./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.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/token_ring.01.cil-1.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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:47:17,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:47:18,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:47:18,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:47:18,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:47:18,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:47:18,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:47:18,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:47:18,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:47:18,062 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:47:18,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:47:18,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:47:18,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:47:18,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:47:18,064 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:47:18,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:47:18,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:47:18,064 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:47:18,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:47:18,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:47:18,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:47:18,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:47:18,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:47:18,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:47:18,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:47:18,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:47:18,066 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:47:18,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:47:18,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:47:18,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:47:18,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:47:18,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:47:18,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:47:18,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:47:18,067 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2025-03-09 02:47:18,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:47:18,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:47:18,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:47:18,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:47:18,324 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:47:18,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2025-03-09 02:47:19,514 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0e143d7/e9364c48548042de820ec85c8a7531ad/FLAG26e0fa3d7 [2025-03-09 02:47:19,760 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:47:19,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2025-03-09 02:47:19,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0e143d7/e9364c48548042de820ec85c8a7531ad/FLAG26e0fa3d7 [2025-03-09 02:47:20,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0e143d7/e9364c48548042de820ec85c8a7531ad [2025-03-09 02:47:20,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:47:20,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:47:20,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:47:20,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:47:20,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:47:20,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20, skipping insertion in model container [2025-03-09 02:47:20,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:47:20,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:47:20,229 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:47:20,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:47:20,262 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:47:20,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20 WrapperNode [2025-03-09 02:47:20,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:47:20,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:47:20,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:47:20,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:47:20,270 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:47:20" (1/1) ... [2025-03-09 02:47:20,282 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:47:20" (1/1) ... [2025-03-09 02:47:20,310 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 212 [2025-03-09 02:47:20,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:47:20,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:47:20,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:47:20,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:47:20,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,327 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:47:20,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:47:20,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:47:20,336 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:47:20,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:47:20,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (1/1) ... [2025-03-09 02:47:20,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:47:20,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:20,365 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:47:20,367 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:47:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:47:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-09 02:47:20,383 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-09 02:47:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-09 02:47:20,384 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-09 02:47:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-09 02:47:20,384 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-09 02:47:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-09 02:47:20,384 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-09 02:47:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-09 02:47:20,384 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-09 02:47:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:47:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-09 02:47:20,384 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-09 02:47:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:47:20,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:47:20,456 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:47:20,457 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:47:20,791 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-09 02:47:20,793 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:47:20,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:47:20,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:47:20,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:47:20 BoogieIcfgContainer [2025-03-09 02:47:20,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:47:20,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:47:20,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:47:20,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:47:20,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:47:20" (1/3) ... [2025-03-09 02:47:20,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6612e808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:47:20, skipping insertion in model container [2025-03-09 02:47:20,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:20" (2/3) ... [2025-03-09 02:47:20,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6612e808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:47:20, skipping insertion in model container [2025-03-09 02:47:20,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:47:20" (3/3) ... [2025-03-09 02:47:20,822 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2025-03-09 02:47:20,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:47:20,836 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.01.cil-1.c that has 7 procedures, 112 locations, 1 initial locations, 4 loop locations, and 4 error locations. [2025-03-09 02:47:20,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:47:20,888 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;@5cb7e34b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:47:20,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 02:47:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 91 states have internal predecessors, (129), 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:47:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 02:47:20,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:20,899 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] [2025-03-09 02:47:20,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:20,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1863986208, now seen corresponding path program 1 times [2025-03-09 02:47:20,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:20,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239917225] [2025-03-09 02:47:20,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:20,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:47:20,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:47:20,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:20,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:21,193 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:47:21,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239917225] [2025-03-09 02:47:21,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239917225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:21,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:21,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729873067] [2025-03-09 02:47:21,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:21,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:21,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:21,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:21,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:21,216 INFO L87 Difference]: Start difference. First operand has 112 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 91 states have internal predecessors, (129), 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 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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:47:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:21,520 INFO L93 Difference]: Finished difference Result 318 states and 457 transitions. [2025-03-09 02:47:21,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:21,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 53 [2025-03-09 02:47:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:21,533 INFO L225 Difference]: With dead ends: 318 [2025-03-09 02:47:21,534 INFO L226 Difference]: Without dead ends: 205 [2025-03-09 02:47:21,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:47:21,541 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 225 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:21,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 410 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-09 02:47:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2025-03-09 02:47:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 154 states have (on average 1.4675324675324675) internal successors, (226), 159 states have internal predecessors, (226), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-09 02:47:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 277 transitions. [2025-03-09 02:47:21,603 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 277 transitions. Word has length 53 [2025-03-09 02:47:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:21,604 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 277 transitions. [2025-03-09 02:47:21,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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:47:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 277 transitions. [2025-03-09 02:47:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 02:47:21,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:21,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:47:21,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:21,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1579235230, now seen corresponding path program 1 times [2025-03-09 02:47:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:21,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385057598] [2025-03-09 02:47:21,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:21,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:47:21,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:47:21,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:21,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:21,808 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:47:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385057598] [2025-03-09 02:47:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385057598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:21,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717738207] [2025-03-09 02:47:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:21,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:21,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:21,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:21,810 INFO L87 Difference]: Start difference. First operand 196 states and 277 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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:47:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:22,163 INFO L93 Difference]: Finished difference Result 494 states and 698 transitions. [2025-03-09 02:47:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:22,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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 53 [2025-03-09 02:47:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:22,167 INFO L225 Difference]: With dead ends: 494 [2025-03-09 02:47:22,169 INFO L226 Difference]: Without dead ends: 307 [2025-03-09 02:47:22,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:47:22,171 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 208 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:22,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 680 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:47:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-09 02:47:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 282. [2025-03-09 02:47:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 223 states have (on average 1.4573991031390134) internal successors, (325), 229 states have internal predecessors, (325), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-09 02:47:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 399 transitions. [2025-03-09 02:47:22,210 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 399 transitions. Word has length 53 [2025-03-09 02:47:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:22,210 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 399 transitions. [2025-03-09 02:47:22,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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:47:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 399 transitions. [2025-03-09 02:47:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 02:47:22,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:22,211 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] [2025-03-09 02:47:22,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:47:22,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:22,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash -356425057, now seen corresponding path program 1 times [2025-03-09 02:47:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:22,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167563371] [2025-03-09 02:47:22,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:22,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:47:22,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:47:22,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:22,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:22,368 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:47:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167563371] [2025-03-09 02:47:22,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167563371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:22,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:22,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352628338] [2025-03-09 02:47:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:22,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:22,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:22,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:22,370 INFO L87 Difference]: Start difference. First operand 282 states and 399 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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:47:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:22,693 INFO L93 Difference]: Finished difference Result 780 states and 1104 transitions. [2025-03-09 02:47:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:22,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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 53 [2025-03-09 02:47:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:22,697 INFO L225 Difference]: With dead ends: 780 [2025-03-09 02:47:22,699 INFO L226 Difference]: Without dead ends: 507 [2025-03-09 02:47:22,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:47:22,701 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 247 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:22,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 651 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:47:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-09 02:47:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 451. [2025-03-09 02:47:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 358 states have (on average 1.441340782122905) internal successors, (516), 368 states have internal predecessors, (516), 53 states have call successors, (53), 30 states have call predecessors, (53), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2025-03-09 02:47:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 638 transitions. [2025-03-09 02:47:22,740 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 638 transitions. Word has length 53 [2025-03-09 02:47:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:22,740 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 638 transitions. [2025-03-09 02:47:22,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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:47:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 638 transitions. [2025-03-09 02:47:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 02:47:22,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:22,743 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] [2025-03-09 02:47:22,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:47:22,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:22,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:22,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1105154942, now seen corresponding path program 1 times [2025-03-09 02:47:22,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:22,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653939911] [2025-03-09 02:47:22,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:22,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:22,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:47:22,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:47:22,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:22,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:22,835 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:47:22,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:22,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653939911] [2025-03-09 02:47:22,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653939911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:22,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:22,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:22,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714259700] [2025-03-09 02:47:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:22,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:22,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:22,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:22,838 INFO L87 Difference]: Start difference. First operand 451 states and 638 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:47:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:22,983 INFO L93 Difference]: Finished difference Result 915 states and 1302 transitions. [2025-03-09 02:47:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:47:22,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 53 [2025-03-09 02:47:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:22,987 INFO L225 Difference]: With dead ends: 915 [2025-03-09 02:47:22,988 INFO L226 Difference]: Without dead ends: 473 [2025-03-09 02:47:22,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:47:22,990 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 164 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:22,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 247 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-09 02:47:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 451. [2025-03-09 02:47:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 358 states have (on average 1.4273743016759777) internal successors, (511), 368 states have internal predecessors, (511), 53 states have call successors, (53), 30 states have call predecessors, (53), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2025-03-09 02:47:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 633 transitions. [2025-03-09 02:47:23,031 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 633 transitions. Word has length 53 [2025-03-09 02:47:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:23,032 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 633 transitions. [2025-03-09 02:47:23,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:47:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 633 transitions. [2025-03-09 02:47:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 02:47:23,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:23,034 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] [2025-03-09 02:47:23,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:47:23,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:23,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:23,035 INFO L85 PathProgramCache]: Analyzing trace with hash 182471359, now seen corresponding path program 1 times [2025-03-09 02:47:23,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:23,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873610593] [2025-03-09 02:47:23,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:23,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:23,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:47:23,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:47:23,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:23,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:23,083 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:47:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873610593] [2025-03-09 02:47:23,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873610593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:23,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:23,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:23,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776059834] [2025-03-09 02:47:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:23,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:23,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:23,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:23,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:47:23,087 INFO L87 Difference]: Start difference. First operand 451 states and 633 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:47:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:23,221 INFO L93 Difference]: Finished difference Result 1300 states and 1853 transitions. [2025-03-09 02:47:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:47:23,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 53 [2025-03-09 02:47:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:23,226 INFO L225 Difference]: With dead ends: 1300 [2025-03-09 02:47:23,227 INFO L226 Difference]: Without dead ends: 859 [2025-03-09 02:47:23,228 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:47:23,229 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 237 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:23,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 455 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-09 02:47:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 852. [2025-03-09 02:47:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 674 states have (on average 1.3842729970326408) internal successors, (933), 695 states have internal predecessors, (933), 102 states have call successors, (102), 60 states have call predecessors, (102), 72 states have return successors, (131), 100 states have call predecessors, (131), 102 states have call successors, (131) [2025-03-09 02:47:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1166 transitions. [2025-03-09 02:47:23,303 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1166 transitions. Word has length 53 [2025-03-09 02:47:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:23,303 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1166 transitions. [2025-03-09 02:47:23,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:47:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1166 transitions. [2025-03-09 02:47:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 02:47:23,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:23,305 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] [2025-03-09 02:47:23,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:47:23,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:23,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1039930443, now seen corresponding path program 1 times [2025-03-09 02:47:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839585034] [2025-03-09 02:47:23,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:23,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:47:23,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:47:23,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:23,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:23,357 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:47:23,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:23,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839585034] [2025-03-09 02:47:23,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839585034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:23,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:23,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134437417] [2025-03-09 02:47:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:23,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:23,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:23,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:23,358 INFO L87 Difference]: Start difference. First operand 852 states and 1166 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:47:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:23,422 INFO L93 Difference]: Finished difference Result 1709 states and 2376 transitions. [2025-03-09 02:47:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:23,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 54 [2025-03-09 02:47:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:23,428 INFO L225 Difference]: With dead ends: 1709 [2025-03-09 02:47:23,428 INFO L226 Difference]: Without dead ends: 867 [2025-03-09 02:47:23,431 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:47:23,431 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:47:23,431 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:47:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-09 02:47:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2025-03-09 02:47:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 689 states have (on average 1.3686502177068214) internal successors, (943), 710 states have internal predecessors, (943), 102 states have call successors, (102), 60 states have call predecessors, (102), 72 states have return successors, (131), 100 states have call predecessors, (131), 102 states have call successors, (131) [2025-03-09 02:47:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1176 transitions. [2025-03-09 02:47:23,503 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1176 transitions. Word has length 54 [2025-03-09 02:47:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:23,503 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1176 transitions. [2025-03-09 02:47:23,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:47:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1176 transitions. [2025-03-09 02:47:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 02:47:23,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:23,504 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] [2025-03-09 02:47:23,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:47:23,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:23,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1390730380, now seen corresponding path program 1 times [2025-03-09 02:47:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131577460] [2025-03-09 02:47:23,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:23,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:23,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:47:23,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:47:23,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:23,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:23,561 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:47:23,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131577460] [2025-03-09 02:47:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131577460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:23,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559835278] [2025-03-09 02:47:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:23,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:23,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:23,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:47:23,562 INFO L87 Difference]: Start difference. First operand 867 states and 1176 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:47:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:23,758 INFO L93 Difference]: Finished difference Result 2534 states and 3454 transitions. [2025-03-09 02:47:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:47:23,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 54 [2025-03-09 02:47:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:23,769 INFO L225 Difference]: With dead ends: 2534 [2025-03-09 02:47:23,769 INFO L226 Difference]: Without dead ends: 1677 [2025-03-09 02:47:23,772 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:47:23,773 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 243 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:23,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 449 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2025-03-09 02:47:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1665. [2025-03-09 02:47:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1323 states have (on average 1.343159486016629) internal successors, (1777), 1361 states have internal predecessors, (1777), 194 states have call successors, (194), 120 states have call predecessors, (194), 144 states have return successors, (249), 187 states have call predecessors, (249), 194 states have call successors, (249) [2025-03-09 02:47:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2220 transitions. [2025-03-09 02:47:23,925 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2220 transitions. Word has length 54 [2025-03-09 02:47:23,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:23,925 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2220 transitions. [2025-03-09 02:47:23,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:47:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2220 transitions. [2025-03-09 02:47:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:47:23,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:23,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:23,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:47:23,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:23,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2073606704, now seen corresponding path program 1 times [2025-03-09 02:47:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:23,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903203251] [2025-03-09 02:47:23,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:23,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:47:23,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:47:23,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:23,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903203251] [2025-03-09 02:47:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903203251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:23,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:23,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:23,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31858658] [2025-03-09 02:47:23,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:23,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:23,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:23,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:23,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:23,986 INFO L87 Difference]: Start difference. First operand 1665 states and 2220 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:47:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:24,062 INFO L93 Difference]: Finished difference Result 3350 states and 4536 transitions. [2025-03-09 02:47:24,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:24,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 69 [2025-03-09 02:47:24,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:24,071 INFO L225 Difference]: With dead ends: 3350 [2025-03-09 02:47:24,071 INFO L226 Difference]: Without dead ends: 1695 [2025-03-09 02:47:24,075 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:47:24,077 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:47:24,078 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:47:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-09 02:47:24,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1695. [2025-03-09 02:47:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1353 states have (on average 1.328159645232816) internal successors, (1797), 1391 states have internal predecessors, (1797), 194 states have call successors, (194), 120 states have call predecessors, (194), 144 states have return successors, (249), 187 states have call predecessors, (249), 194 states have call successors, (249) [2025-03-09 02:47:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2240 transitions. [2025-03-09 02:47:24,178 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2240 transitions. Word has length 69 [2025-03-09 02:47:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:24,178 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2240 transitions. [2025-03-09 02:47:24,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:47:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2240 transitions. [2025-03-09 02:47:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:47:24,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:24,181 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:24,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:47:24,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:24,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash -759780593, now seen corresponding path program 1 times [2025-03-09 02:47:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:24,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835738064] [2025-03-09 02:47:24,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:24,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:47:24,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:47:24,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:24,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:24,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:24,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835738064] [2025-03-09 02:47:24,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835738064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:24,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336838690] [2025-03-09 02:47:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:24,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:24,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:24,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:24,282 INFO L87 Difference]: Start difference. First operand 1695 states and 2240 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:24,555 INFO L93 Difference]: Finished difference Result 2503 states and 3316 transitions. [2025-03-09 02:47:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:24,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-09 02:47:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:24,562 INFO L225 Difference]: With dead ends: 2503 [2025-03-09 02:47:24,562 INFO L226 Difference]: Without dead ends: 1447 [2025-03-09 02:47:24,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:47:24,565 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 201 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:24,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 451 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-03-09 02:47:24,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1335. [2025-03-09 02:47:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1069 states have (on average 1.3199251637043967) internal successors, (1411), 1089 states have internal predecessors, (1411), 158 states have call successors, (158), 96 states have call predecessors, (158), 104 states have return successors, (171), 151 states have call predecessors, (171), 158 states have call successors, (171) [2025-03-09 02:47:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1740 transitions. [2025-03-09 02:47:24,620 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1740 transitions. Word has length 69 [2025-03-09 02:47:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:24,620 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 1740 transitions. [2025-03-09 02:47:24,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1740 transitions. [2025-03-09 02:47:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:47:24,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:24,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:24,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:47:24,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:24,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash 965700304, now seen corresponding path program 1 times [2025-03-09 02:47:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:24,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269317630] [2025-03-09 02:47:24,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:24,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:24,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:47:24,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:47:24,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:24,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269317630] [2025-03-09 02:47:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269317630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:24,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:24,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122200480] [2025-03-09 02:47:24,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:24,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:24,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:24,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:24,723 INFO L87 Difference]: Start difference. First operand 1335 states and 1740 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:25,003 INFO L93 Difference]: Finished difference Result 2309 states and 3017 transitions. [2025-03-09 02:47:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:25,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-09 02:47:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:25,009 INFO L225 Difference]: With dead ends: 2309 [2025-03-09 02:47:25,009 INFO L226 Difference]: Without dead ends: 1289 [2025-03-09 02:47:25,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:47:25,011 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 202 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:25,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 438 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-03-09 02:47:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1177. [2025-03-09 02:47:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 945 states have (on average 1.3216931216931216) internal successors, (1249), 960 states have internal predecessors, (1249), 140 states have call successors, (140), 84 states have call predecessors, (140), 88 states have return successors, (144), 133 states have call predecessors, (144), 140 states have call successors, (144) [2025-03-09 02:47:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1533 transitions. [2025-03-09 02:47:25,060 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1533 transitions. Word has length 69 [2025-03-09 02:47:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:25,061 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1533 transitions. [2025-03-09 02:47:25,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1533 transitions. [2025-03-09 02:47:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:47:25,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:25,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:25,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:47:25,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:25,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1991192303, now seen corresponding path program 1 times [2025-03-09 02:47:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041151786] [2025-03-09 02:47:25,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:25,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:47:25,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:47:25,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:25,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:25,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041151786] [2025-03-09 02:47:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041151786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:25,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139733790] [2025-03-09 02:47:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:25,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:25,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:25,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:25,114 INFO L87 Difference]: Start difference. First operand 1177 states and 1533 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:25,304 INFO L93 Difference]: Finished difference Result 2633 states and 3410 transitions. [2025-03-09 02:47:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:25,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-09 02:47:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:25,311 INFO L225 Difference]: With dead ends: 2633 [2025-03-09 02:47:25,311 INFO L226 Difference]: Without dead ends: 1467 [2025-03-09 02:47:25,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:47:25,314 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 172 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:25,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 243 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-03-09 02:47:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1427. [2025-03-09 02:47:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1169 states have (on average 1.2566295979469633) internal successors, (1469), 1184 states have internal predecessors, (1469), 146 states have call successors, (146), 104 states have call predecessors, (146), 108 states have return successors, (164), 139 states have call predecessors, (164), 146 states have call successors, (164) [2025-03-09 02:47:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1779 transitions. [2025-03-09 02:47:25,398 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1779 transitions. Word has length 69 [2025-03-09 02:47:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:25,399 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1779 transitions. [2025-03-09 02:47:25,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1779 transitions. [2025-03-09 02:47:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:47:25,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:25,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:25,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:47:25,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:25,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:25,400 INFO L85 PathProgramCache]: Analyzing trace with hash -192484624, now seen corresponding path program 1 times [2025-03-09 02:47:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:25,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753200605] [2025-03-09 02:47:25,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:25,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:25,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:47:25,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:47:25,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:25,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:47:25,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:25,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753200605] [2025-03-09 02:47:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753200605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914016051] [2025-03-09 02:47:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:25,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:25,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:25,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:25,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:47:25,438 INFO L87 Difference]: Start difference. First operand 1427 states and 1779 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (6), 2 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:47:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:25,664 INFO L93 Difference]: Finished difference Result 4004 states and 5072 transitions. [2025-03-09 02:47:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (6), 2 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 69 [2025-03-09 02:47:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:25,675 INFO L225 Difference]: With dead ends: 4004 [2025-03-09 02:47:25,675 INFO L226 Difference]: Without dead ends: 2588 [2025-03-09 02:47:25,679 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:47:25,679 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 169 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:25,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 316 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2025-03-09 02:47:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2505. [2025-03-09 02:47:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2040 states have (on average 1.2465686274509804) internal successors, (2543), 2067 states have internal predecessors, (2543), 263 states have call successors, (263), 180 states have call predecessors, (263), 198 states have return successors, (349), 259 states have call predecessors, (349), 263 states have call successors, (349) [2025-03-09 02:47:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3155 transitions. [2025-03-09 02:47:25,799 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3155 transitions. Word has length 69 [2025-03-09 02:47:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3155 transitions. [2025-03-09 02:47:25,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (6), 2 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:47:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3155 transitions. [2025-03-09 02:47:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-09 02:47:25,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:25,801 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:47:25,801 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:25,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1873030789, now seen corresponding path program 1 times [2025-03-09 02:47:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824562401] [2025-03-09 02:47:25,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:25,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 02:47:25,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 02:47:25,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:25,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:47:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824562401] [2025-03-09 02:47:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824562401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:47:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602852732] [2025-03-09 02:47:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:25,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:25,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:25,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:47:25,821 INFO L87 Difference]: Start difference. First operand 2505 states and 3155 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:47:25,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:25,885 INFO L93 Difference]: Finished difference Result 4537 states and 5671 transitions. [2025-03-09 02:47:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:25,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 71 [2025-03-09 02:47:25,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:25,895 INFO L225 Difference]: With dead ends: 4537 [2025-03-09 02:47:25,895 INFO L226 Difference]: Without dead ends: 2043 [2025-03-09 02:47:25,899 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:47:25,900 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 141 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:47:25,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-03-09 02:47:26,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2013. [2025-03-09 02:47:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1648 states have (on average 1.2378640776699028) internal successors, (2040), 1672 states have internal predecessors, (2040), 203 states have call successors, (203), 142 states have call predecessors, (203), 158 states have return successors, (259), 199 states have call predecessors, (259), 203 states have call successors, (259) [2025-03-09 02:47:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2502 transitions. [2025-03-09 02:47:26,010 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2502 transitions. Word has length 71 [2025-03-09 02:47:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:26,011 INFO L471 AbstractCegarLoop]: Abstraction has 2013 states and 2502 transitions. [2025-03-09 02:47:26,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:47:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2502 transitions. [2025-03-09 02:47:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 02:47:26,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:26,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:26,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:47:26,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:26,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1984757264, now seen corresponding path program 1 times [2025-03-09 02:47:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433997217] [2025-03-09 02:47:26,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:26,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 02:47:26,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 02:47:26,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:26,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:47:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:26,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433997217] [2025-03-09 02:47:26,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433997217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:26,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:26,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206565993] [2025-03-09 02:47:26,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:26,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:26,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:26,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:26,062 INFO L87 Difference]: Start difference. First operand 2013 states and 2502 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (6), 2 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:47:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:26,463 INFO L93 Difference]: Finished difference Result 5472 states and 6828 transitions. [2025-03-09 02:47:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:47:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (6), 2 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 73 [2025-03-09 02:47:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:26,478 INFO L225 Difference]: With dead ends: 5472 [2025-03-09 02:47:26,478 INFO L226 Difference]: Without dead ends: 3470 [2025-03-09 02:47:26,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:47:26,483 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 565 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:26,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 463 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-03-09 02:47:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3401. [2025-03-09 02:47:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 2788 states have (on average 1.2209469153515065) internal successors, (3404), 2830 states have internal predecessors, (3404), 335 states have call successors, (335), 237 states have call predecessors, (335), 274 states have return successors, (472), 335 states have call predecessors, (472), 335 states have call successors, (472) [2025-03-09 02:47:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4211 transitions. [2025-03-09 02:47:26,641 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4211 transitions. Word has length 73 [2025-03-09 02:47:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:26,642 INFO L471 AbstractCegarLoop]: Abstraction has 3401 states and 4211 transitions. [2025-03-09 02:47:26,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (6), 2 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:47:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4211 transitions. [2025-03-09 02:47:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 02:47:26,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:26,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:47:26,643 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:26,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2059375533, now seen corresponding path program 1 times [2025-03-09 02:47:26,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:26,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918669085] [2025-03-09 02:47:26,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:26,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:26,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 02:47:26,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 02:47:26,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:26,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 02:47:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918669085] [2025-03-09 02:47:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918669085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:26,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:26,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320699398] [2025-03-09 02:47:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:26,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:26,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:26,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:47:26,729 INFO L87 Difference]: Start difference. First operand 3401 states and 4211 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:47:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:27,082 INFO L93 Difference]: Finished difference Result 5723 states and 7093 transitions. [2025-03-09 02:47:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:27,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2025-03-09 02:47:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:27,102 INFO L225 Difference]: With dead ends: 5723 [2025-03-09 02:47:27,103 INFO L226 Difference]: Without dead ends: 3419 [2025-03-09 02:47:27,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:47:27,110 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 147 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:27,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 331 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2025-03-09 02:47:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3411. [2025-03-09 02:47:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3411 states, 2793 states have (on average 1.2119584675975654) internal successors, (3385), 2839 states have internal predecessors, (3385), 335 states have call successors, (335), 237 states have call predecessors, (335), 279 states have return successors, (448), 336 states have call predecessors, (448), 335 states have call successors, (448) [2025-03-09 02:47:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 4168 transitions. [2025-03-09 02:47:27,370 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 4168 transitions. Word has length 87 [2025-03-09 02:47:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:27,371 INFO L471 AbstractCegarLoop]: Abstraction has 3411 states and 4168 transitions. [2025-03-09 02:47:27,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:47:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 4168 transitions. [2025-03-09 02:47:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 02:47:27,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:27,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:47:27,373 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2115471890, now seen corresponding path program 1 times [2025-03-09 02:47:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:27,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485838598] [2025-03-09 02:47:27,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:27,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:27,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 02:47:27,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 02:47:27,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:27,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 02:47:27,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:27,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485838598] [2025-03-09 02:47:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485838598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:27,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:47:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59037747] [2025-03-09 02:47:27,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:27,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:27,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:27,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:47:27,403 INFO L87 Difference]: Start difference. First operand 3411 states and 4168 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 02:47:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:27,549 INFO L93 Difference]: Finished difference Result 3413 states and 4168 transitions. [2025-03-09 02:47:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2025-03-09 02:47:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:27,559 INFO L225 Difference]: With dead ends: 3413 [2025-03-09 02:47:27,559 INFO L226 Difference]: Without dead ends: 2645 [2025-03-09 02:47:27,561 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:47:27,562 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 140 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:47:27,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2025-03-09 02:47:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2645. [2025-03-09 02:47:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2171 states have (on average 1.2197144173192078) internal successors, (2648), 2207 states have internal predecessors, (2648), 254 states have call successors, (254), 180 states have call predecessors, (254), 216 states have return successors, (351), 258 states have call predecessors, (351), 254 states have call successors, (351) [2025-03-09 02:47:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3253 transitions. [2025-03-09 02:47:27,678 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3253 transitions. Word has length 87 [2025-03-09 02:47:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:27,678 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3253 transitions. [2025-03-09 02:47:27,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 02:47:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3253 transitions. [2025-03-09 02:47:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-09 02:47:27,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:27,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:47:27,681 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:27,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2002960609, now seen corresponding path program 1 times [2025-03-09 02:47:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:27,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100518154] [2025-03-09 02:47:27,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:27,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-09 02:47:27,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 02:47:27,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:27,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:47:27,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:27,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100518154] [2025-03-09 02:47:27,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100518154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:27,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:27,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:47:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69863983] [2025-03-09 02:47:27,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:27,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:27,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:27,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:27,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:27,750 INFO L87 Difference]: Start difference. First operand 2645 states and 3253 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 02:47:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:28,356 INFO L93 Difference]: Finished difference Result 4928 states and 6066 transitions. [2025-03-09 02:47:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:47:28,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2025-03-09 02:47:28,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:28,378 INFO L225 Difference]: With dead ends: 4928 [2025-03-09 02:47:28,379 INFO L226 Difference]: Without dead ends: 2838 [2025-03-09 02:47:28,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:47:28,384 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 819 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:28,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 690 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:47:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2025-03-09 02:47:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2645. [2025-03-09 02:47:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2171 states have (on average 1.2095808383233533) internal successors, (2626), 2207 states have internal predecessors, (2626), 254 states have call successors, (254), 180 states have call predecessors, (254), 216 states have return successors, (318), 258 states have call predecessors, (318), 254 states have call successors, (318) [2025-03-09 02:47:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3198 transitions. [2025-03-09 02:47:28,514 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3198 transitions. Word has length 89 [2025-03-09 02:47:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:28,514 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3198 transitions. [2025-03-09 02:47:28,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 02:47:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3198 transitions. [2025-03-09 02:47:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 02:47:28,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:28,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 02:47:28,516 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:28,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1260267650, now seen corresponding path program 1 times [2025-03-09 02:47:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:28,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378728860] [2025-03-09 02:47:28,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:28,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:47:28,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:47:28,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:28,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 02:47:28,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:28,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378728860] [2025-03-09 02:47:28,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378728860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:28,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:47:28,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719453173] [2025-03-09 02:47:28,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:28,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:28,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:28,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:28,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:47:28,557 INFO L87 Difference]: Start difference. First operand 2645 states and 3198 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:47:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:28,681 INFO L93 Difference]: Finished difference Result 2645 states and 3198 transitions. [2025-03-09 02:47:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:28,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 95 [2025-03-09 02:47:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:28,697 INFO L225 Difference]: With dead ends: 2645 [2025-03-09 02:47:28,697 INFO L226 Difference]: Without dead ends: 2644 [2025-03-09 02:47:28,699 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:47:28,699 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:28,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2025-03-09 02:47:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2025-03-09 02:47:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2171 states have (on average 1.2068171349608476) internal successors, (2620), 2206 states have internal predecessors, (2620), 254 states have call successors, (254), 180 states have call predecessors, (254), 216 states have return successors, (318), 258 states have call predecessors, (318), 254 states have call successors, (318) [2025-03-09 02:47:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3192 transitions. [2025-03-09 02:47:28,877 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3192 transitions. Word has length 95 [2025-03-09 02:47:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:28,878 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3192 transitions. [2025-03-09 02:47:28,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:47:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3192 transitions. [2025-03-09 02:47:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 02:47:28,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:28,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:47:28,880 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:47:28,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash -413591411, now seen corresponding path program 1 times [2025-03-09 02:47:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264463426] [2025-03-09 02:47:28,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:28,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 02:47:28,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 02:47:28,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:28,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 02:47:28,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 02:47:28,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 02:47:28,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 02:47:28,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:28,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 02:47:28,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 02:47:28,939 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 02:47:28,941 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 02:47:28,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 02:47:28,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 02:47:28,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 02:47:28,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:47:28,946 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] [2025-03-09 02:47:29,023 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:47:29,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:47:29 BoogieIcfgContainer [2025-03-09 02:47:29,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:47:29,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:47:29,026 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:47:29,026 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:47:29,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:47:20" (3/4) ... [2025-03-09 02:47:29,030 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-09 02:47:29,102 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 69. [2025-03-09 02:47:29,163 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:47:29,164 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:47:29,164 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:47:29,164 INFO L158 Benchmark]: Toolchain (without parser) took 9076.37ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 109.8MB in the beginning and 556.6MB in the end (delta: -446.8MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2025-03-09 02:47:29,165 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:47:29,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.29ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 96.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:47:29,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.66ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.6MB in the end (delta: 994.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:47:29,165 INFO L158 Benchmark]: Boogie Preprocessor took 25.15ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:47:29,165 INFO L158 Benchmark]: IcfgBuilder took 474.36ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 74.0MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:47:29,166 INFO L158 Benchmark]: TraceAbstraction took 8213.08ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 74.0MB in the beginning and 569.2MB in the end (delta: -495.2MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2025-03-09 02:47:29,166 INFO L158 Benchmark]: Witness Printer took 137.97ms. Allocated memory is still 679.5MB. Free memory was 569.2MB in the beginning and 556.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:47:29,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.29ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 96.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.66ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.6MB in the end (delta: 994.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.15ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 474.36ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 74.0MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8213.08ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 74.0MB in the beginning and 569.2MB in the end (delta: -495.2MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Witness Printer took 137.97ms. Allocated memory is still 679.5MB. Free memory was 569.2MB in the beginning and 556.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L421] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L259] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L264] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L269] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L274] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L124] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L134] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L153] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L287] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L292] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L302] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L240] RET transmit1() [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L201] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L341] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L134] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L341] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L107] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 112 locations, 174 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4098 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4000 mSDsluCounter, 7365 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4696 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3007 IncrementalHoareTripleChecker+Invalid, 3614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 2669 mSDtfsCounter, 3007 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3411occurred in iteration=15, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 778 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1316 NumberOfCodeBlocks, 1316 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1202 ConstructedInterpolants, 0 QuantifiedInterpolants, 1971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 189/189 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-09 02:47:29,186 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)