./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/token_ring.02.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.02.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 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:47:32,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:47:32,911 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:32,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:47:32,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:47:32,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:47:32,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:47:32,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:47:32,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:47:32,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:47:32,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:47:32,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:47:32,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:47:32,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:47:32,941 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:47:32,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:47:32,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:47:32,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:47:32,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:47:32,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:47:32,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:47:32,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:47:32,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:47:32,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:47:32,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:47:32,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:47:32,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:47:32,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:47:32,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:47:32,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:47:32,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:47:32,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:47:32,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:47:32,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:47:32,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:47:32,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:47:32,944 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 -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2025-03-09 02:47:33,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:47:33,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:47:33,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:47:33,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:47:33,171 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:47:33,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2025-03-09 02:47:34,489 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77830b594/dcbb544e76844c83ab8805646457e9e1/FLAG5cdaec29a [2025-03-09 02:47:34,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:47:34,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2025-03-09 02:47:34,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77830b594/dcbb544e76844c83ab8805646457e9e1/FLAG5cdaec29a [2025-03-09 02:47:34,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77830b594/dcbb544e76844c83ab8805646457e9e1 [2025-03-09 02:47:34,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:47:34,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:47:34,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:47:34,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:47:34,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:47:34,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:47:34" (1/1) ... [2025-03-09 02:47:34,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f2be06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:34, skipping insertion in model container [2025-03-09 02:47:34,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:47:34" (1/1) ... [2025-03-09 02:47:34,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:47:34,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:47:34,981 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:47:35,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:47:35,024 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:47:35,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:35 WrapperNode [2025-03-09 02:47:35,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:47:35,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:47:35,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:47:35,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:47:35,031 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:35" (1/1) ... [2025-03-09 02:47:35,037 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:35" (1/1) ... [2025-03-09 02:47:35,056 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 271 [2025-03-09 02:47:35,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:47:35,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:47:35,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:47:35,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:47:35,065 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:35" (1/1) ... [2025-03-09 02:47:35,065 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:35" (1/1) ... [2025-03-09 02:47:35,067 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:35" (1/1) ... [2025-03-09 02:47:35,082 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:35,082 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:35" (1/1) ... [2025-03-09 02:47:35,084 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:35" (1/1) ... [2025-03-09 02:47:35,087 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:35" (1/1) ... [2025-03-09 02:47:35,091 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:35" (1/1) ... [2025-03-09 02:47:35,092 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:35" (1/1) ... [2025-03-09 02:47:35,096 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:35" (1/1) ... [2025-03-09 02:47:35,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:47:35,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:47:35,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:47:35,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:47:35,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:35" (1/1) ... [2025-03-09 02:47:35,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:47:35,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:35,126 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:35,128 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:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:47:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-09 02:47:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-09 02:47:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-09 02:47:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-09 02:47:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-09 02:47:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-09 02:47:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-09 02:47:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-09 02:47:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-09 02:47:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-09 02:47:35,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:47:35,149 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-09 02:47:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-09 02:47:35,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:47:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:47:35,208 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:47:35,210 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:47:35,514 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-09 02:47:35,514 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:47:35,527 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:47:35,529 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:47:35,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:47:35 BoogieIcfgContainer [2025-03-09 02:47:35,530 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:47:35,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:47:35,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:47:35,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:47:35,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:47:34" (1/3) ... [2025-03-09 02:47:35,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c99e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:47:35, skipping insertion in model container [2025-03-09 02:47:35,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:47:35" (2/3) ... [2025-03-09 02:47:35,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c99e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:47:35, skipping insertion in model container [2025-03-09 02:47:35,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:47:35" (3/3) ... [2025-03-09 02:47:35,540 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2025-03-09 02:47:35,554 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:47:35,555 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.02.cil-1.c that has 7 procedures, 140 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-03-09 02:47:35,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:47:35,613 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;@1d0fbe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:47:35,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 02:47:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 118 states have internal predecessors, (172), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 02:47:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:47:35,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:35,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:35,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:35,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:35,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1344139342, now seen corresponding path program 1 times [2025-03-09 02:47:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505171466] [2025-03-09 02:47:35,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:35,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:47:35,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:47:35,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:35,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:36,060 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:36,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505171466] [2025-03-09 02:47:36,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505171466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143421324] [2025-03-09 02:47:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:36,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:36,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:36,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:36,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:36,086 INFO L87 Difference]: Start difference. First operand has 140 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 118 states have internal predecessors, (172), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:36,636 INFO L93 Difference]: Finished difference Result 412 states and 615 transitions. [2025-03-09 02:47:36,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:36,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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 64 [2025-03-09 02:47:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:36,646 INFO L225 Difference]: With dead ends: 412 [2025-03-09 02:47:36,646 INFO L226 Difference]: Without dead ends: 272 [2025-03-09 02:47:36,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:47:36,651 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 303 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:36,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1018 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:47:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-09 02:47:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 254. [2025-03-09 02:47:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 205 states have (on average 1.526829268292683) internal successors, (313), 213 states have internal predecessors, (313), 29 states have call successors, (29), 12 states have call predecessors, (29), 14 states have return successors, (36), 30 states have call predecessors, (36), 29 states have call successors, (36) [2025-03-09 02:47:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2025-03-09 02:47:36,705 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 64 [2025-03-09 02:47:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:36,706 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2025-03-09 02:47:36,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2025-03-09 02:47:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:47:36,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:36,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:36,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:47:36,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash -210948749, now seen corresponding path program 1 times [2025-03-09 02:47:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079561556] [2025-03-09 02:47:36,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:36,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:47:36,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:47:36,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:36,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:36,859 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:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079561556] [2025-03-09 02:47:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079561556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921927448] [2025-03-09 02:47:36,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:36,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:36,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:36,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:36,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:36,861 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:37,226 INFO L93 Difference]: Finished difference Result 749 states and 1124 transitions. [2025-03-09 02:47:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:37,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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 64 [2025-03-09 02:47:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:37,230 INFO L225 Difference]: With dead ends: 749 [2025-03-09 02:47:37,230 INFO L226 Difference]: Without dead ends: 507 [2025-03-09 02:47:37,232 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:37,232 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 294 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:37,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 886 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:47:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-09 02:47:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 486. [2025-03-09 02:47:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 399 states have (on average 1.5238095238095237) internal successors, (608), 411 states have internal predecessors, (608), 51 states have call successors, (51), 24 states have call predecessors, (51), 30 states have return successors, (74), 54 states have call predecessors, (74), 51 states have call successors, (74) [2025-03-09 02:47:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 733 transitions. [2025-03-09 02:47:37,272 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 733 transitions. Word has length 64 [2025-03-09 02:47:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:37,272 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 733 transitions. [2025-03-09 02:47:37,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 733 transitions. [2025-03-09 02:47:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:47:37,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:37,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:37,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:47:37,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:37,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash -451488878, now seen corresponding path program 1 times [2025-03-09 02:47:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:37,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950690846] [2025-03-09 02:47:37,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:37,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:47:37,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:47:37,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:37,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:37,373 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:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950690846] [2025-03-09 02:47:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950690846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:37,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:37,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223920536] [2025-03-09 02:47:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:37,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:37,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:37,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:37,374 INFO L87 Difference]: Start difference. First operand 486 states and 733 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:37,800 INFO L93 Difference]: Finished difference Result 1546 states and 2354 transitions. [2025-03-09 02:47:37,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:37,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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 64 [2025-03-09 02:47:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:37,807 INFO L225 Difference]: With dead ends: 1546 [2025-03-09 02:47:37,807 INFO L226 Difference]: Without dead ends: 1072 [2025-03-09 02:47:37,809 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:37,810 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 364 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:37,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 869 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:47:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-09 02:47:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 954. [2025-03-09 02:47:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 789 states have (on average 1.5183776932826363) internal successors, (1198), 815 states have internal predecessors, (1198), 91 states have call successors, (91), 48 states have call predecessors, (91), 68 states have return successors, (170), 98 states have call predecessors, (170), 91 states have call successors, (170) [2025-03-09 02:47:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1459 transitions. [2025-03-09 02:47:37,883 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1459 transitions. Word has length 64 [2025-03-09 02:47:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:37,884 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1459 transitions. [2025-03-09 02:47:37,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1459 transitions. [2025-03-09 02:47:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:47:37,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:37,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:37,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:47:37,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:37,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash -459248237, now seen corresponding path program 1 times [2025-03-09 02:47:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677060107] [2025-03-09 02:47:37,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:37,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:47:37,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:47:37,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:37,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:37,970 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:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:37,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677060107] [2025-03-09 02:47:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677060107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:37,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:37,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076027692] [2025-03-09 02:47:37,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:37,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:37,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:37,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:37,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:37,971 INFO L87 Difference]: Start difference. First operand 954 states and 1459 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:38,151 INFO L93 Difference]: Finished difference Result 1979 states and 3081 transitions. [2025-03-09 02:47:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:47:38,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 64 [2025-03-09 02:47:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:38,156 INFO L225 Difference]: With dead ends: 1979 [2025-03-09 02:47:38,156 INFO L226 Difference]: Without dead ends: 1035 [2025-03-09 02:47:38,158 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:38,159 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 225 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:38,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 336 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-03-09 02:47:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 954. [2025-03-09 02:47:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 789 states have (on average 1.5069708491761724) internal successors, (1189), 815 states have internal predecessors, (1189), 91 states have call successors, (91), 48 states have call predecessors, (91), 68 states have return successors, (170), 98 states have call predecessors, (170), 91 states have call successors, (170) [2025-03-09 02:47:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1450 transitions. [2025-03-09 02:47:38,231 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1450 transitions. Word has length 64 [2025-03-09 02:47:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:38,232 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1450 transitions. [2025-03-09 02:47:38,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1450 transitions. [2025-03-09 02:47:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:47:38,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:38,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:38,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:47:38,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:38,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash 510332786, now seen corresponding path program 1 times [2025-03-09 02:47:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:38,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65723238] [2025-03-09 02:47:38,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:38,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:38,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:47:38,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:47:38,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:38,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:38,319 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:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:38,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65723238] [2025-03-09 02:47:38,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65723238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:38,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:38,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:38,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757660642] [2025-03-09 02:47:38,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:38,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:38,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:38,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:38,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:38,322 INFO L87 Difference]: Start difference. First operand 954 states and 1450 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:38,703 INFO L93 Difference]: Finished difference Result 2930 states and 4524 transitions. [2025-03-09 02:47:38,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:38,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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 64 [2025-03-09 02:47:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:38,713 INFO L225 Difference]: With dead ends: 2930 [2025-03-09 02:47:38,713 INFO L226 Difference]: Without dead ends: 1988 [2025-03-09 02:47:38,715 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:38,717 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 291 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:38,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 831 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:47:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2025-03-09 02:47:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1892. [2025-03-09 02:47:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1557 states have (on average 1.489402697495183) internal successors, (2319), 1629 states have internal predecessors, (2319), 167 states have call successors, (167), 96 states have call predecessors, (167), 162 states have return successors, (454), 182 states have call predecessors, (454), 167 states have call successors, (454) [2025-03-09 02:47:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2940 transitions. [2025-03-09 02:47:38,841 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2940 transitions. Word has length 64 [2025-03-09 02:47:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:38,842 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2940 transitions. [2025-03-09 02:47:38,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2940 transitions. [2025-03-09 02:47:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:47:38,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:38,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:38,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:47:38,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:38,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1813695053, now seen corresponding path program 1 times [2025-03-09 02:47:38,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:38,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680225577] [2025-03-09 02:47:38,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:38,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:38,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:47:38,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:47:38,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:38,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:38,903 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:38,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:38,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680225577] [2025-03-09 02:47:38,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680225577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:38,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:38,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:38,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811079140] [2025-03-09 02:47:38,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:38,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:38,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:38,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:38,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:47:38,904 INFO L87 Difference]: Start difference. First operand 1892 states and 2940 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:39,151 INFO L93 Difference]: Finished difference Result 5552 states and 8718 transitions. [2025-03-09 02:47:39,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:47:39,151 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), 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 64 [2025-03-09 02:47:39,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:39,169 INFO L225 Difference]: With dead ends: 5552 [2025-03-09 02:47:39,169 INFO L226 Difference]: Without dead ends: 3672 [2025-03-09 02:47:39,176 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:39,178 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 316 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:39,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 623 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2025-03-09 02:47:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3652. [2025-03-09 02:47:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 2994 states have (on average 1.4599198396793587) internal successors, (4371), 3148 states have internal predecessors, (4371), 328 states have call successors, (328), 192 states have call predecessors, (328), 324 states have return successors, (871), 327 states have call predecessors, (871), 328 states have call successors, (871) [2025-03-09 02:47:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5570 transitions. [2025-03-09 02:47:39,357 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5570 transitions. Word has length 64 [2025-03-09 02:47:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:39,358 INFO L471 AbstractCegarLoop]: Abstraction has 3652 states and 5570 transitions. [2025-03-09 02:47:39,358 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), 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:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5570 transitions. [2025-03-09 02:47:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:47:39,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:39,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:39,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:47:39,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:39,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1083026168, now seen corresponding path program 1 times [2025-03-09 02:47:39,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:39,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506605927] [2025-03-09 02:47:39,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:39,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:39,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:47:39,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:47:39,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:39,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:39,411 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:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:39,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506605927] [2025-03-09 02:47:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506605927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:39,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:39,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:39,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504058826] [2025-03-09 02:47:39,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:39,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:39,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:39,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:39,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:39,413 INFO L87 Difference]: Start difference. First operand 3652 states and 5570 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:39,540 INFO L93 Difference]: Finished difference Result 7340 states and 11316 transitions. [2025-03-09 02:47:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:39,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 65 [2025-03-09 02:47:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:39,558 INFO L225 Difference]: With dead ends: 7340 [2025-03-09 02:47:39,558 INFO L226 Difference]: Without dead ends: 3700 [2025-03-09 02:47:39,566 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:39,567 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 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:39,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 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:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2025-03-09 02:47:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3700. [2025-03-09 02:47:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 3042 states have (on average 1.4474030243261014) internal successors, (4403), 3196 states have internal predecessors, (4403), 328 states have call successors, (328), 192 states have call predecessors, (328), 324 states have return successors, (871), 327 states have call predecessors, (871), 328 states have call successors, (871) [2025-03-09 02:47:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5602 transitions. [2025-03-09 02:47:39,770 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5602 transitions. Word has length 65 [2025-03-09 02:47:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:39,771 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5602 transitions. [2025-03-09 02:47:39,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5602 transitions. [2025-03-09 02:47:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:47:39,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:39,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:39,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:47:39,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:39,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2005709751, now seen corresponding path program 1 times [2025-03-09 02:47:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:39,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234316942] [2025-03-09 02:47:39,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:39,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:47:39,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:47:39,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:39,816 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:39,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:39,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234316942] [2025-03-09 02:47:39,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234316942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:39,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:39,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:39,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354913034] [2025-03-09 02:47:39,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:39,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:39,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:39,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:39,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:47:39,818 INFO L87 Difference]: Start difference. First operand 3700 states and 5602 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:40,378 INFO L93 Difference]: Finished difference Result 10944 states and 16640 transitions. [2025-03-09 02:47:40,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:47:40,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 65 [2025-03-09 02:47:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:40,418 INFO L225 Difference]: With dead ends: 10944 [2025-03-09 02:47:40,419 INFO L226 Difference]: Without dead ends: 7256 [2025-03-09 02:47:40,434 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:40,434 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 322 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:40,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 617 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2025-03-09 02:47:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 7220. [2025-03-09 02:47:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7220 states, 5932 states have (on average 1.4313890761968981) internal successors, (8491), 6234 states have internal predecessors, (8491), 634 states have call successors, (634), 384 states have call predecessors, (634), 648 states have return successors, (1689), 617 states have call predecessors, (1689), 634 states have call successors, (1689) [2025-03-09 02:47:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 10814 transitions. [2025-03-09 02:47:40,795 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 10814 transitions. Word has length 65 [2025-03-09 02:47:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:40,795 INFO L471 AbstractCegarLoop]: Abstraction has 7220 states and 10814 transitions. [2025-03-09 02:47:40,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 10814 transitions. [2025-03-09 02:47:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:47:40,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:40,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:40,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:47:40,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:40,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:40,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1064673160, now seen corresponding path program 1 times [2025-03-09 02:47:40,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:40,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824449130] [2025-03-09 02:47:40,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:40,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:40,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:47:40,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:47:40,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:40,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:40,870 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:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:40,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824449130] [2025-03-09 02:47:40,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824449130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:40,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910159205] [2025-03-09 02:47:40,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:40,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:40,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:40,872 INFO L87 Difference]: Start difference. First operand 7220 states and 10814 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:41,145 INFO L93 Difference]: Finished difference Result 14524 states and 21982 transitions. [2025-03-09 02:47:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:41,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-09 02:47:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:41,181 INFO L225 Difference]: With dead ends: 14524 [2025-03-09 02:47:41,181 INFO L226 Difference]: Without dead ends: 7316 [2025-03-09 02:47:41,194 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:41,195 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 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:41,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 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:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2025-03-09 02:47:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 7316. [2025-03-09 02:47:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7316 states, 6028 states have (on average 1.4192103516921035) internal successors, (8555), 6330 states have internal predecessors, (8555), 634 states have call successors, (634), 384 states have call predecessors, (634), 648 states have return successors, (1689), 617 states have call predecessors, (1689), 634 states have call successors, (1689) [2025-03-09 02:47:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7316 states to 7316 states and 10878 transitions. [2025-03-09 02:47:41,574 INFO L78 Accepts]: Start accepts. Automaton has 7316 states and 10878 transitions. Word has length 66 [2025-03-09 02:47:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:41,574 INFO L471 AbstractCegarLoop]: Abstraction has 7316 states and 10878 transitions. [2025-03-09 02:47:41,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 7316 states and 10878 transitions. [2025-03-09 02:47:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:47:41,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:41,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:41,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:47:41,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:41,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash -39181161, now seen corresponding path program 1 times [2025-03-09 02:47:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:41,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46342952] [2025-03-09 02:47:41,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:41,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:41,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:47:41,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:47:41,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:41,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:41,635 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:41,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46342952] [2025-03-09 02:47:41,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46342952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:41,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:41,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:41,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793483459] [2025-03-09 02:47:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:41,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:41,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:41,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:41,637 INFO L87 Difference]: Start difference. First operand 7316 states and 10878 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:42,606 INFO L93 Difference]: Finished difference Result 24714 states and 36978 transitions. [2025-03-09 02:47:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:42,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-09 02:47:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:42,680 INFO L225 Difference]: With dead ends: 24714 [2025-03-09 02:47:42,680 INFO L226 Difference]: Without dead ends: 16740 [2025-03-09 02:47:42,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:42,704 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 646 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:42,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 736 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16740 states. [2025-03-09 02:47:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16740 to 14645. [2025-03-09 02:47:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14645 states, 12061 states have (on average 1.4123207030926126) internal successors, (17034), 12686 states have internal predecessors, (17034), 1238 states have call successors, (1238), 772 states have call predecessors, (1238), 1340 states have return successors, (3399), 1202 states have call predecessors, (3399), 1238 states have call successors, (3399) [2025-03-09 02:47:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14645 states to 14645 states and 21671 transitions. [2025-03-09 02:47:43,399 INFO L78 Accepts]: Start accepts. Automaton has 14645 states and 21671 transitions. Word has length 66 [2025-03-09 02:47:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:43,400 INFO L471 AbstractCegarLoop]: Abstraction has 14645 states and 21671 transitions. [2025-03-09 02:47:43,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 14645 states and 21671 transitions. [2025-03-09 02:47:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:47:43,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:43,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:43,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:47:43,408 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:43,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:43,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1474573282, now seen corresponding path program 1 times [2025-03-09 02:47:43,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:43,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621024535] [2025-03-09 02:47:43,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:43,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:47:43,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:47:43,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:43,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:43,466 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:43,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:43,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621024535] [2025-03-09 02:47:43,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621024535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:43,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:43,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971573635] [2025-03-09 02:47:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:43,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:43,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:43,468 INFO L87 Difference]: Start difference. First operand 14645 states and 21671 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:43,891 INFO L93 Difference]: Finished difference Result 29566 states and 44246 transitions. [2025-03-09 02:47:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:43,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 81 [2025-03-09 02:47:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:43,949 INFO L225 Difference]: With dead ends: 29566 [2025-03-09 02:47:43,950 INFO L226 Difference]: Without dead ends: 14933 [2025-03-09 02:47:43,977 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:43,977 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 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:43,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 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:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14933 states. [2025-03-09 02:47:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14933 to 14933. [2025-03-09 02:47:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14933 states, 12349 states have (on average 1.3975220665640942) internal successors, (17258), 12974 states have internal predecessors, (17258), 1238 states have call successors, (1238), 772 states have call predecessors, (1238), 1340 states have return successors, (3399), 1202 states have call predecessors, (3399), 1238 states have call successors, (3399) [2025-03-09 02:47:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14933 states to 14933 states and 21895 transitions. [2025-03-09 02:47:44,884 INFO L78 Accepts]: Start accepts. Automaton has 14933 states and 21895 transitions. Word has length 81 [2025-03-09 02:47:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:44,884 INFO L471 AbstractCegarLoop]: Abstraction has 14933 states and 21895 transitions. [2025-03-09 02:47:44,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 14933 states and 21895 transitions. [2025-03-09 02:47:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:47:44,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:44,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:44,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:47:44,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:44,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1025876643, now seen corresponding path program 1 times [2025-03-09 02:47:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:44,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469967906] [2025-03-09 02:47:44,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:44,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:47:44,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:47:44,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:44,959 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:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:44,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469967906] [2025-03-09 02:47:44,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469967906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:44,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:44,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653034159] [2025-03-09 02:47:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:44,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:44,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:44,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:44,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:44,961 INFO L87 Difference]: Start difference. First operand 14933 states and 21895 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:45,787 INFO L93 Difference]: Finished difference Result 17817 states and 26086 transitions. [2025-03-09 02:47:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:45,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 81 [2025-03-09 02:47:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:45,832 INFO L225 Difference]: With dead ends: 17817 [2025-03-09 02:47:45,833 INFO L226 Difference]: Without dead ends: 16322 [2025-03-09 02:47:45,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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:45,839 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 289 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:45,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 485 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16322 states. [2025-03-09 02:47:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16322 to 15771. [2025-03-09 02:47:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15771 states, 13054 states have (on average 1.3783514631530565) internal successors, (17993), 13685 states have internal predecessors, (17993), 1318 states have call successors, (1318), 822 states have call predecessors, (1318), 1393 states have return successors, (3349), 1279 states have call predecessors, (3349), 1318 states have call successors, (3349) [2025-03-09 02:47:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15771 states to 15771 states and 22660 transitions. [2025-03-09 02:47:46,476 INFO L78 Accepts]: Start accepts. Automaton has 15771 states and 22660 transitions. Word has length 81 [2025-03-09 02:47:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:46,477 INFO L471 AbstractCegarLoop]: Abstraction has 15771 states and 22660 transitions. [2025-03-09 02:47:46,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 15771 states and 22660 transitions. [2025-03-09 02:47:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:47:46,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:46,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:46,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:47:46,483 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash 103193060, now seen corresponding path program 1 times [2025-03-09 02:47:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:46,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673978445] [2025-03-09 02:47:46,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:46,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:47:46,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:47:46,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:46,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:46,587 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:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673978445] [2025-03-09 02:47:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673978445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:46,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:46,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073729419] [2025-03-09 02:47:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:46,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:46,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:46,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:46,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:46,589 INFO L87 Difference]: Start difference. First operand 15771 states and 22660 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:47,222 INFO L93 Difference]: Finished difference Result 18445 states and 26438 transitions. [2025-03-09 02:47:47,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:47,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 81 [2025-03-09 02:47:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:47,260 INFO L225 Difference]: With dead ends: 18445 [2025-03-09 02:47:47,260 INFO L226 Difference]: Without dead ends: 9558 [2025-03-09 02:47:47,278 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:47,279 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 289 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:47,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 629 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:47:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9558 states. [2025-03-09 02:47:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9558 to 8851. [2025-03-09 02:47:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8851 states, 7379 states have (on average 1.357636536116005) internal successors, (10018), 7600 states have internal predecessors, (10018), 792 states have call successors, (792), 488 states have call predecessors, (792), 674 states have return successors, (1309), 770 states have call predecessors, (1309), 792 states have call successors, (1309) [2025-03-09 02:47:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 12119 transitions. [2025-03-09 02:47:47,580 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 12119 transitions. Word has length 81 [2025-03-09 02:47:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:47,580 INFO L471 AbstractCegarLoop]: Abstraction has 8851 states and 12119 transitions. [2025-03-09 02:47:47,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 12119 transitions. [2025-03-09 02:47:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:47:47,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:47,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:47,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:47:47,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:47,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1735997059, now seen corresponding path program 1 times [2025-03-09 02:47:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880301059] [2025-03-09 02:47:47,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:47,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:47:47,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:47:47,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:47,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:47,672 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:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880301059] [2025-03-09 02:47:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880301059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:47,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:47,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:47,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025018552] [2025-03-09 02:47:47,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:47,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:47,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:47,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:47,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:47,674 INFO L87 Difference]: Start difference. First operand 8851 states and 12119 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:48,063 INFO L93 Difference]: Finished difference Result 11153 states and 15375 transitions. [2025-03-09 02:47:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 81 [2025-03-09 02:47:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:48,087 INFO L225 Difference]: With dead ends: 11153 [2025-03-09 02:47:48,087 INFO L226 Difference]: Without dead ends: 5614 [2025-03-09 02:47:48,097 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:48,097 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 281 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:48,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 621 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5614 states. [2025-03-09 02:47:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5614 to 5279. [2025-03-09 02:47:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5279 states, 4425 states have (on average 1.3536723163841808) internal successors, (5990), 4510 states have internal predecessors, (5990), 488 states have call successors, (488), 296 states have call predecessors, (488), 360 states have return successors, (629), 476 states have call predecessors, (629), 488 states have call successors, (629) [2025-03-09 02:47:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 7107 transitions. [2025-03-09 02:47:48,317 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 7107 transitions. Word has length 81 [2025-03-09 02:47:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:48,317 INFO L471 AbstractCegarLoop]: Abstraction has 5279 states and 7107 transitions. [2025-03-09 02:47:48,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 7107 transitions. [2025-03-09 02:47:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:47:48,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:48,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:48,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:47:48,320 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:48,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2065762820, now seen corresponding path program 1 times [2025-03-09 02:47:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:48,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527658363] [2025-03-09 02:47:48,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:48,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:47:48,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:47:48,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:48,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:48,393 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:48,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:48,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527658363] [2025-03-09 02:47:48,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527658363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:48,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:48,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:48,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466021628] [2025-03-09 02:47:48,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:48,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:48,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:48,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:48,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:48,395 INFO L87 Difference]: Start difference. First operand 5279 states and 7107 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:48,792 INFO L93 Difference]: Finished difference Result 8667 states and 11768 transitions. [2025-03-09 02:47:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:48,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 81 [2025-03-09 02:47:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:48,814 INFO L225 Difference]: With dead ends: 8667 [2025-03-09 02:47:48,815 INFO L226 Difference]: Without dead ends: 4994 [2025-03-09 02:47:48,822 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:48,823 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 296 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:48,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 608 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2025-03-09 02:47:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4405. [2025-03-09 02:47:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4405 states, 3706 states have (on average 1.3559093362115489) internal successors, (5025), 3755 states have internal predecessors, (5025), 414 states have call successors, (414), 248 states have call predecessors, (414), 279 states have return successors, (471), 403 states have call predecessors, (471), 414 states have call successors, (471) [2025-03-09 02:47:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 4405 states and 5910 transitions. [2025-03-09 02:47:48,979 INFO L78 Accepts]: Start accepts. Automaton has 4405 states and 5910 transitions. Word has length 81 [2025-03-09 02:47:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:48,979 INFO L471 AbstractCegarLoop]: Abstraction has 4405 states and 5910 transitions. [2025-03-09 02:47:48,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4405 states and 5910 transitions. [2025-03-09 02:47:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:47:48,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:48,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:48,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:47:48,981 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:48,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:48,982 INFO L85 PathProgramCache]: Analyzing trace with hash -278904221, now seen corresponding path program 1 times [2025-03-09 02:47:48,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:48,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975958824] [2025-03-09 02:47:48,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:48,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:48,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:47:48,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:47:48,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:48,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:49,044 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:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975958824] [2025-03-09 02:47:49,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975958824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:49,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:49,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447753420] [2025-03-09 02:47:49,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:49,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:49,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:49,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:49,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:49,045 INFO L87 Difference]: Start difference. First operand 4405 states and 5910 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:49,352 INFO L93 Difference]: Finished difference Result 10264 states and 13638 transitions. [2025-03-09 02:47:49,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 81 [2025-03-09 02:47:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:49,374 INFO L225 Difference]: With dead ends: 10264 [2025-03-09 02:47:49,374 INFO L226 Difference]: Without dead ends: 5871 [2025-03-09 02:47:49,382 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:49,382 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 247 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:49,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 326 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2025-03-09 02:47:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5353. [2025-03-09 02:47:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5353 states, 4582 states have (on average 1.3000872981230904) internal successors, (5957), 4627 states have internal predecessors, (5957), 430 states have call successors, (430), 304 states have call predecessors, (430), 335 states have return successors, (522), 423 states have call predecessors, (522), 430 states have call successors, (522) [2025-03-09 02:47:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5353 states to 5353 states and 6909 transitions. [2025-03-09 02:47:49,661 INFO L78 Accepts]: Start accepts. Automaton has 5353 states and 6909 transitions. Word has length 81 [2025-03-09 02:47:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:49,661 INFO L471 AbstractCegarLoop]: Abstraction has 5353 states and 6909 transitions. [2025-03-09 02:47:49,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 5353 states and 6909 transitions. [2025-03-09 02:47:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:47:49,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:49,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:49,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:47:49,662 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:49,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:49,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1446576676, now seen corresponding path program 1 times [2025-03-09 02:47:49,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:49,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201644819] [2025-03-09 02:47:49,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:49,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:49,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:47:49,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:47:49,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:49,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:49,761 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:49,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201644819] [2025-03-09 02:47:49,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201644819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:49,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:49,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:49,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798178779] [2025-03-09 02:47:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:49,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:49,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:49,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:49,762 INFO L87 Difference]: Start difference. First operand 5353 states and 6909 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:50,288 INFO L93 Difference]: Finished difference Result 8907 states and 11569 transitions. [2025-03-09 02:47:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:47:50,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 81 [2025-03-09 02:47:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:50,313 INFO L225 Difference]: With dead ends: 8907 [2025-03-09 02:47:50,313 INFO L226 Difference]: Without dead ends: 5038 [2025-03-09 02:47:50,320 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:50,321 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 263 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:50,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 586 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5038 states. [2025-03-09 02:47:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5038 to 4642. [2025-03-09 02:47:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4642 states, 3980 states have (on average 1.3045226130653267) internal successors, (5192), 4010 states have internal predecessors, (5192), 375 states have call successors, (375), 263 states have call predecessors, (375), 281 states have return successors, (441), 369 states have call predecessors, (441), 375 states have call successors, (441) [2025-03-09 02:47:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 6008 transitions. [2025-03-09 02:47:50,634 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 6008 transitions. Word has length 81 [2025-03-09 02:47:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:50,635 INFO L471 AbstractCegarLoop]: Abstraction has 4642 states and 6008 transitions. [2025-03-09 02:47:50,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 6008 transitions. [2025-03-09 02:47:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:47:50,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:50,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:50,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 02:47:50,638 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:50,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1822898621, now seen corresponding path program 1 times [2025-03-09 02:47:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:50,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022512894] [2025-03-09 02:47:50,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:50,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:50,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:47:50,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:47:50,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:50,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:50,690 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:50,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:50,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022512894] [2025-03-09 02:47:50,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022512894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:50,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:50,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:50,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286232825] [2025-03-09 02:47:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:50,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:50,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:50,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:50,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:47:50,693 INFO L87 Difference]: Start difference. First operand 4642 states and 6008 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:51,387 INFO L93 Difference]: Finished difference Result 13367 states and 17518 transitions. [2025-03-09 02:47:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:51,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 81 [2025-03-09 02:47:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:51,431 INFO L225 Difference]: With dead ends: 13367 [2025-03-09 02:47:51,432 INFO L226 Difference]: Without dead ends: 8737 [2025-03-09 02:47:51,445 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:51,445 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 242 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:51,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 454 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2025-03-09 02:47:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8429. [2025-03-09 02:47:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8429 states, 7198 states have (on average 1.2967490969713809) internal successors, (9334), 7263 states have internal predecessors, (9334), 687 states have call successors, (687), 464 states have call predecessors, (687), 538 states have return successors, (970), 703 states have call predecessors, (970), 687 states have call successors, (970) [2025-03-09 02:47:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8429 states to 8429 states and 10991 transitions. [2025-03-09 02:47:51,871 INFO L78 Accepts]: Start accepts. Automaton has 8429 states and 10991 transitions. Word has length 81 [2025-03-09 02:47:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:51,872 INFO L471 AbstractCegarLoop]: Abstraction has 8429 states and 10991 transitions. [2025-03-09 02:47:51,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 8429 states and 10991 transitions. [2025-03-09 02:47:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 02:47:51,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:51,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:51,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:47:51,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:51,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1497188194, now seen corresponding path program 1 times [2025-03-09 02:47:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:51,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709223113] [2025-03-09 02:47:51,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:51,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 02:47:51,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 02:47:51,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:51,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:51,897 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:51,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:51,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709223113] [2025-03-09 02:47:51,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709223113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:51,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:47:51,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85044945] [2025-03-09 02:47:51,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:51,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:51,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:51,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:51,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:47:51,899 INFO L87 Difference]: Start difference. First operand 8429 states and 10991 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:52,085 INFO L93 Difference]: Finished difference Result 15437 states and 20011 transitions. [2025-03-09 02:47:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:52,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 83 [2025-03-09 02:47:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:52,115 INFO L225 Difference]: With dead ends: 15437 [2025-03-09 02:47:52,115 INFO L226 Difference]: Without dead ends: 7020 [2025-03-09 02:47:52,127 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:52,128 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 185 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:52,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 185 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:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7020 states. [2025-03-09 02:47:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7020 to 6860. [2025-03-09 02:47:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6860 states, 5880 states have (on average 1.2887755102040817) internal successors, (7578), 5940 states have internal predecessors, (7578), 536 states have call successors, (536), 368 states have call predecessors, (536), 438 states have return successors, (746), 552 states have call predecessors, (746), 536 states have call successors, (746) [2025-03-09 02:47:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6860 states to 6860 states and 8860 transitions. [2025-03-09 02:47:52,451 INFO L78 Accepts]: Start accepts. Automaton has 6860 states and 8860 transitions. Word has length 83 [2025-03-09 02:47:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:52,452 INFO L471 AbstractCegarLoop]: Abstraction has 6860 states and 8860 transitions. [2025-03-09 02:47:52,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6860 states and 8860 transitions. [2025-03-09 02:47:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-09 02:47:52,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:52,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:52,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:47:52,452 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:52,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash -348320265, now seen corresponding path program 1 times [2025-03-09 02:47:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140900701] [2025-03-09 02:47:52,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:52,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 02:47:52,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 02:47:52,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:52,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:52,489 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:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140900701] [2025-03-09 02:47:52,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140900701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:52,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:52,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090472530] [2025-03-09 02:47:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:52,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:52,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:52,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:47:52,490 INFO L87 Difference]: Start difference. First operand 6860 states and 8860 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:52,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:52,999 INFO L93 Difference]: Finished difference Result 20520 states and 26499 transitions. [2025-03-09 02:47:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:52,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 85 [2025-03-09 02:47:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:53,045 INFO L225 Difference]: With dead ends: 20520 [2025-03-09 02:47:53,045 INFO L226 Difference]: Without dead ends: 13672 [2025-03-09 02:47:53,060 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:53,061 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 216 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:53,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 390 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13672 states. [2025-03-09 02:47:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13672 to 13592. [2025-03-09 02:47:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13592 states, 11552 states have (on average 1.269909972299169) internal successors, (14670), 11752 states have internal predecessors, (14670), 1038 states have call successors, (1038), 724 states have call predecessors, (1038), 996 states have return successors, (1741), 1117 states have call predecessors, (1741), 1038 states have call successors, (1741) [2025-03-09 02:47:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13592 states to 13592 states and 17449 transitions. [2025-03-09 02:47:53,568 INFO L78 Accepts]: Start accepts. Automaton has 13592 states and 17449 transitions. Word has length 85 [2025-03-09 02:47:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:53,568 INFO L471 AbstractCegarLoop]: Abstraction has 13592 states and 17449 transitions. [2025-03-09 02:47:53,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13592 states and 17449 transitions. [2025-03-09 02:47:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-09 02:47:53,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:53,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:53,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 02:47:53,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:53,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash 760494934, now seen corresponding path program 1 times [2025-03-09 02:47:53,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:53,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116782355] [2025-03-09 02:47:53,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:53,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:53,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 02:47:53,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 02:47:53,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:53,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 02:47:53,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116782355] [2025-03-09 02:47:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116782355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:53,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:53,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:47:53,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136221322] [2025-03-09 02:47:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:53,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:53,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:53,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:47:53,592 INFO L87 Difference]: Start difference. First operand 13592 states and 17449 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:53,976 INFO L93 Difference]: Finished difference Result 24348 states and 31233 transitions. [2025-03-09 02:47:53,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:53,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 85 [2025-03-09 02:47:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:54,012 INFO L225 Difference]: With dead ends: 24348 [2025-03-09 02:47:54,012 INFO L226 Difference]: Without dead ends: 10768 [2025-03-09 02:47:54,030 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:54,031 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 178 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 184 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:54,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 184 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:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10768 states. [2025-03-09 02:47:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10768 to 10768. [2025-03-09 02:47:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10768 states, 9180 states have (on average 1.271132897603486) internal successors, (11669), 9326 states have internal predecessors, (11669), 820 states have call successors, (820), 574 states have call predecessors, (820), 762 states have return successors, (1312), 868 states have call predecessors, (1312), 820 states have call successors, (1312) [2025-03-09 02:47:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10768 states to 10768 states and 13801 transitions. [2025-03-09 02:47:54,430 INFO L78 Accepts]: Start accepts. Automaton has 10768 states and 13801 transitions. Word has length 85 [2025-03-09 02:47:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:54,430 INFO L471 AbstractCegarLoop]: Abstraction has 10768 states and 13801 transitions. [2025-03-09 02:47:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 10768 states and 13801 transitions. [2025-03-09 02:47:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:47:54,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:54,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:54,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 02:47:54,432 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:54,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1628695543, now seen corresponding path program 1 times [2025-03-09 02:47:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584502421] [2025-03-09 02:47:54,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:54,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:47:54,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:47:54,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:54,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:47:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584502421] [2025-03-09 02:47:54,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584502421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:54,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:54,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:54,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453051896] [2025-03-09 02:47:54,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:54,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:54,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:54,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:54,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:47:54,467 INFO L87 Difference]: Start difference. First operand 10768 states and 13801 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:55,310 INFO L93 Difference]: Finished difference Result 32122 states and 41128 transitions. [2025-03-09 02:47:55,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 86 [2025-03-09 02:47:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:55,391 INFO L225 Difference]: With dead ends: 32122 [2025-03-09 02:47:55,391 INFO L226 Difference]: Without dead ends: 21366 [2025-03-09 02:47:55,411 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:55,414 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 225 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:55,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 470 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21366 states. [2025-03-09 02:47:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21366 to 21300. [2025-03-09 02:47:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21300 states, 18151 states have (on average 1.258002313922098) internal successors, (22834), 18484 states have internal predecessors, (22834), 1582 states have call successors, (1582), 1124 states have call predecessors, (1582), 1561 states have return successors, (2624), 1693 states have call predecessors, (2624), 1582 states have call successors, (2624) [2025-03-09 02:47:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21300 states to 21300 states and 27040 transitions. [2025-03-09 02:47:56,225 INFO L78 Accepts]: Start accepts. Automaton has 21300 states and 27040 transitions. Word has length 86 [2025-03-09 02:47:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:56,226 INFO L471 AbstractCegarLoop]: Abstraction has 21300 states and 27040 transitions. [2025-03-09 02:47:56,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 21300 states and 27040 transitions. [2025-03-09 02:47:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:47:56,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:56,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 02:47:56,228 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1209178712, now seen corresponding path program 1 times [2025-03-09 02:47:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:56,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219275501] [2025-03-09 02:47:56,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:56,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:47:56,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:47:56,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:56,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 02:47:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:56,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219275501] [2025-03-09 02:47:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219275501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:56,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:47:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383622250] [2025-03-09 02:47:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:56,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:56,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:56,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:47:56,251 INFO L87 Difference]: Start difference. First operand 21300 states and 27040 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:57,177 INFO L93 Difference]: Finished difference Result 38606 states and 49010 transitions. [2025-03-09 02:47:57,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:57,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 86 [2025-03-09 02:47:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:57,241 INFO L225 Difference]: With dead ends: 38606 [2025-03-09 02:47:57,241 INFO L226 Difference]: Without dead ends: 17318 [2025-03-09 02:47:57,275 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:57,275 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 178 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 183 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:57,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 183 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:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17318 states. [2025-03-09 02:47:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17318 to 17318. [2025-03-09 02:47:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17318 states, 14768 states have (on average 1.258261105092091) internal successors, (18582), 15043 states have internal predecessors, (18582), 1269 states have call successors, (1269), 902 states have call predecessors, (1269), 1275 states have return successors, (2135), 1373 states have call predecessors, (2135), 1269 states have call successors, (2135) [2025-03-09 02:47:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17318 states to 17318 states and 21986 transitions. [2025-03-09 02:47:58,119 INFO L78 Accepts]: Start accepts. Automaton has 17318 states and 21986 transitions. Word has length 86 [2025-03-09 02:47:58,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:58,119 INFO L471 AbstractCegarLoop]: Abstraction has 17318 states and 21986 transitions. [2025-03-09 02:47:58,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 17318 states and 21986 transitions. [2025-03-09 02:47:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 02:47:58,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:58,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:58,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 02:47:58,120 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:58,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1689369885, now seen corresponding path program 1 times [2025-03-09 02:47:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:58,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704315265] [2025-03-09 02:47:58,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:58,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:58,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 02:47:58,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 02:47:58,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:58,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:58,179 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:58,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:58,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704315265] [2025-03-09 02:47:58,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704315265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:58,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:58,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929828744] [2025-03-09 02:47:58,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:58,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:58,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:58,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:58,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:58,180 INFO L87 Difference]: Start difference. First operand 17318 states and 21986 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:58,992 INFO L93 Difference]: Finished difference Result 28151 states and 36027 transitions. [2025-03-09 02:47:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:47:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 87 [2025-03-09 02:47:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:59,049 INFO L225 Difference]: With dead ends: 28151 [2025-03-09 02:47:59,049 INFO L226 Difference]: Without dead ends: 14957 [2025-03-09 02:47:59,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:47:59,073 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 735 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:59,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 754 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:47:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14957 states. [2025-03-09 02:47:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14957 to 14379. [2025-03-09 02:47:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14379 states, 12291 states have (on average 1.2590513383776747) internal successors, (15475), 12516 states have internal predecessors, (15475), 1030 states have call successors, (1030), 728 states have call predecessors, (1030), 1052 states have return successors, (1778), 1135 states have call predecessors, (1778), 1030 states have call successors, (1778) [2025-03-09 02:47:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14379 states to 14379 states and 18283 transitions. [2025-03-09 02:47:59,712 INFO L78 Accepts]: Start accepts. Automaton has 14379 states and 18283 transitions. Word has length 87 [2025-03-09 02:47:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:59,713 INFO L471 AbstractCegarLoop]: Abstraction has 14379 states and 18283 transitions. [2025-03-09 02:47:59,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 14379 states and 18283 transitions. [2025-03-09 02:47:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-09 02:47:59,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:59,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:59,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 02:47:59,714 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:47:59,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:59,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1269111857, now seen corresponding path program 1 times [2025-03-09 02:47:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:59,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017593088] [2025-03-09 02:47:59,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:59,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:59,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-09 02:47:59,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 02:47:59,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:59,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:47:59,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017593088] [2025-03-09 02:47:59,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017593088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:59,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:59,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:59,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764478330] [2025-03-09 02:47:59,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:59,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:59,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:59,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:59,756 INFO L87 Difference]: Start difference. First operand 14379 states and 18283 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 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:48:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:00,828 INFO L93 Difference]: Finished difference Result 25771 states and 32784 transitions. [2025-03-09 02:48:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:48:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 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 90 [2025-03-09 02:48:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:00,880 INFO L225 Difference]: With dead ends: 25771 [2025-03-09 02:48:00,881 INFO L226 Difference]: Without dead ends: 14895 [2025-03-09 02:48:00,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:48:00,899 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 658 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:00,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 887 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:48:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14895 states. [2025-03-09 02:48:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14895 to 14294. [2025-03-09 02:48:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14294 states, 12214 states have (on average 1.2548714589814967) internal successors, (15327), 12439 states have internal predecessors, (15327), 1026 states have call successors, (1026), 724 states have call predecessors, (1026), 1048 states have return successors, (1753), 1131 states have call predecessors, (1753), 1026 states have call successors, (1753) [2025-03-09 02:48:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14294 states to 14294 states and 18106 transitions. [2025-03-09 02:48:01,457 INFO L78 Accepts]: Start accepts. Automaton has 14294 states and 18106 transitions. Word has length 90 [2025-03-09 02:48:01,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:01,458 INFO L471 AbstractCegarLoop]: Abstraction has 14294 states and 18106 transitions. [2025-03-09 02:48:01,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 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:48:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 14294 states and 18106 transitions. [2025-03-09 02:48:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 02:48:01,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:01,462 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:01,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 02:48:01,463 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:48:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 637483216, now seen corresponding path program 1 times [2025-03-09 02:48:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195819173] [2025-03-09 02:48:01,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:01,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 02:48:01,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 02:48:01,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:01,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 02:48:01,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:01,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195819173] [2025-03-09 02:48:01,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195819173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:01,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:01,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:01,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261950995] [2025-03-09 02:48:01,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:01,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:01,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:01,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:01,505 INFO L87 Difference]: Start difference. First operand 14294 states and 18106 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:48:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:02,187 INFO L93 Difference]: Finished difference Result 27496 states and 34875 transitions. [2025-03-09 02:48:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:02,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 98 [2025-03-09 02:48:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:02,249 INFO L225 Difference]: With dead ends: 27496 [2025-03-09 02:48:02,249 INFO L226 Difference]: Without dead ends: 16087 [2025-03-09 02:48:02,267 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:48:02,267 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 137 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:02,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 381 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:02,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16087 states. [2025-03-09 02:48:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16087 to 13776. [2025-03-09 02:48:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13776 states, 11762 states have (on average 1.2439211018534262) internal successors, (14631), 11974 states have internal predecessors, (14631), 1008 states have call successors, (1008), 714 states have call predecessors, (1008), 1000 states have return successors, (1654), 1088 states have call predecessors, (1654), 1008 states have call successors, (1654) [2025-03-09 02:48:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13776 states to 13776 states and 17293 transitions. [2025-03-09 02:48:02,860 INFO L78 Accepts]: Start accepts. Automaton has 13776 states and 17293 transitions. Word has length 98 [2025-03-09 02:48:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:02,861 INFO L471 AbstractCegarLoop]: Abstraction has 13776 states and 17293 transitions. [2025-03-09 02:48:02,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:48:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13776 states and 17293 transitions. [2025-03-09 02:48:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 02:48:02,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:02,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:02,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 02:48:02,862 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:48:02,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:02,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1440557571, now seen corresponding path program 1 times [2025-03-09 02:48:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476289438] [2025-03-09 02:48:02,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:02,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 02:48:02,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 02:48:02,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:02,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 02:48:02,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476289438] [2025-03-09 02:48:02,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476289438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:02,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:02,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:48:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207598577] [2025-03-09 02:48:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:48:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:02,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:48:02,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:02,920 INFO L87 Difference]: Start difference. First operand 13776 states and 17293 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 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:48:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:04,076 INFO L93 Difference]: Finished difference Result 26121 states and 32823 transitions. [2025-03-09 02:48:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:48:04,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 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 109 [2025-03-09 02:48:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:04,130 INFO L225 Difference]: With dead ends: 26121 [2025-03-09 02:48:04,130 INFO L226 Difference]: Without dead ends: 15145 [2025-03-09 02:48:04,145 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:48:04,145 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1215 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:04,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 963 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:48:04,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15145 states. [2025-03-09 02:48:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15145 to 13776. [2025-03-09 02:48:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13776 states, 11762 states have (on average 1.2366094201666382) internal successors, (14545), 11974 states have internal predecessors, (14545), 1008 states have call successors, (1008), 714 states have call predecessors, (1008), 1000 states have return successors, (1525), 1088 states have call predecessors, (1525), 1008 states have call successors, (1525) [2025-03-09 02:48:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13776 states to 13776 states and 17078 transitions. [2025-03-09 02:48:04,755 INFO L78 Accepts]: Start accepts. Automaton has 13776 states and 17078 transitions. Word has length 109 [2025-03-09 02:48:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:04,755 INFO L471 AbstractCegarLoop]: Abstraction has 13776 states and 17078 transitions. [2025-03-09 02:48:04,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 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:48:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13776 states and 17078 transitions. [2025-03-09 02:48:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-09 02:48:04,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:04,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:04,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 02:48:04,757 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:48:04,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1684283868, now seen corresponding path program 1 times [2025-03-09 02:48:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794556082] [2025-03-09 02:48:04,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:04,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 02:48:04,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 02:48:04,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:04,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-09 02:48:04,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:04,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794556082] [2025-03-09 02:48:04,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794556082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:04,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:04,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:48:04,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882382174] [2025-03-09 02:48:04,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:04,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:04,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:04,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:04,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:04,791 INFO L87 Difference]: Start difference. First operand 13776 states and 17078 transitions. Second operand has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 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:48:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:05,408 INFO L93 Difference]: Finished difference Result 13776 states and 17078 transitions. [2025-03-09 02:48:05,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:05,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 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 115 [2025-03-09 02:48:05,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:05,444 INFO L225 Difference]: With dead ends: 13776 [2025-03-09 02:48:05,444 INFO L226 Difference]: Without dead ends: 13774 [2025-03-09 02:48:05,447 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:48:05,447 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:05,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 175 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13774 states. [2025-03-09 02:48:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13774 to 13774. [2025-03-09 02:48:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13774 states, 11762 states have (on average 1.2323584424417615) internal successors, (14495), 11972 states have internal predecessors, (14495), 1008 states have call successors, (1008), 714 states have call predecessors, (1008), 1000 states have return successors, (1525), 1088 states have call predecessors, (1525), 1008 states have call successors, (1525) [2025-03-09 02:48:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13774 states to 13774 states and 17028 transitions. [2025-03-09 02:48:06,342 INFO L78 Accepts]: Start accepts. Automaton has 13774 states and 17028 transitions. Word has length 115 [2025-03-09 02:48:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:06,342 INFO L471 AbstractCegarLoop]: Abstraction has 13774 states and 17028 transitions. [2025-03-09 02:48:06,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 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:48:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 13774 states and 17028 transitions. [2025-03-09 02:48:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-09 02:48:06,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:06,344 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 02:48:06,344 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:48:06,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 673192480, now seen corresponding path program 1 times [2025-03-09 02:48:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:06,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970932029] [2025-03-09 02:48:06,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:06,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 02:48:06,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 02:48:06,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:06,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 02:48:06,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 02:48:06,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 02:48:06,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 02:48:06,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:06,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 02:48:06,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 02:48:06,389 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 02:48:06,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 02:48:06,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 02:48:06,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 02:48:06,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 02:48:06,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 02:48:06,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 02:48:06,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 02:48:06,394 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:06,464 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:48:06,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:48:06 BoogieIcfgContainer [2025-03-09 02:48:06,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:48:06,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:48:06,467 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:48:06,468 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:48:06,468 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:35" (3/4) ... [2025-03-09 02:48:06,469 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-09 02:48:06,555 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 84. [2025-03-09 02:48:06,626 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:48:06,626 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:48:06,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:48:06,626 INFO L158 Benchmark]: Toolchain (without parser) took 31831.95ms. Allocated memory was 201.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 153.2MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-09 02:48:06,627 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 192.9MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:06,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.91ms. Allocated memory is still 201.3MB. Free memory was 153.2MB in the beginning and 139.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:48:06,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 137.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:06,627 INFO L158 Benchmark]: Boogie Preprocessor took 38.99ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 136.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:06,627 INFO L158 Benchmark]: IcfgBuilder took 432.37ms. Allocated memory is still 201.3MB. Free memory was 136.3MB in the beginning and 113.0MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:48:06,627 INFO L158 Benchmark]: TraceAbstraction took 30935.12ms. Allocated memory was 201.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 112.3MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-09 02:48:06,627 INFO L158 Benchmark]: Witness Printer took 158.71ms. Allocated memory is still 4.1GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:48:06,632 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.24ms. Allocated memory is still 192.9MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.91ms. Allocated memory is still 201.3MB. Free memory was 153.2MB in the beginning and 139.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 137.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.99ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 136.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 432.37ms. Allocated memory is still 201.3MB. Free memory was 136.3MB in the beginning and 113.0MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 30935.12ms. Allocated memory was 201.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 112.3MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 158.71ms. Allocated memory is still 4.1GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 16.8MB). 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: 113]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L598] int __retres1 ; [L602] CALL init_model() [L512] m_i = 1 [L513] t1_i = 1 [L514] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L602] RET init_model() [L603] CALL start_simulation() [L539] int kernel_st ; [L540] int tmp ; [L541] int tmp___0 ; [L545] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L546] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L547] CALL init_threads() [L231] COND TRUE m_i == 1 [L232] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L236] COND TRUE t1_i == 1 [L237] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L241] COND TRUE t2_i == 1 [L242] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L547] RET init_threads() [L548] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L344] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L349] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L354] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L359] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L364] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L369] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L166] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L176] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L431] CALL, EXPR is_transmit1_triggered() [L182] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L185] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L195] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L439] CALL, EXPR is_transmit2_triggered() [L201] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L204] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L214] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L382] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L387] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L392] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L397] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L402] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L407] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L556] kernel_st = 1 [L557] CALL eval() [L277] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L272] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] tmp = exists_runnable_thread() [L286] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L311] RET transmit1() [L319] COND TRUE t2_st == 0 [L320] int tmp_ndt_3; [L321] tmp_ndt_3 = __VERIFIER_nondet_int() [L322] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L272] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] tmp = exists_runnable_thread() [L286] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND TRUE \read(tmp_ndt_1) [L296] m_st = 1 [L297] CALL master() [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L455] CALL activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L166] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L176] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L431] CALL, EXPR is_transmit1_triggered() [L182] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L185] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L186] COND TRUE E_1 == 1 [L187] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND TRUE \read(tmp___0) [L434] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L439] CALL, EXPR is_transmit2_triggered() [L201] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L204] COND FALSE !(t2_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L214] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L455] RET activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L297] RET master() [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L97] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L113] token += 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: 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, 140 locations, 220 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 30.8s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8735 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8561 mSDsluCounter, 16411 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10830 mSDsCounter, 1017 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6003 IncrementalHoareTripleChecker+Invalid, 7020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1017 mSolverCounterUnsat, 5581 mSDtfsCounter, 6003 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21300occurred in iteration=22, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 11054 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2334 NumberOfCodeBlocks, 2334 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2190 ConstructedInterpolants, 0 QuantifiedInterpolants, 3756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 282/282 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:48:06,654 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)