./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.02.cil-2.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 bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:34:47,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:34:47,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:34:47,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:34:47,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:34:47,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:34:47,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:34:47,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:34:47,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:34:47,793 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:34:47,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:34:47,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:34:47,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:34:47,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:34:47,795 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:34:47,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:34:47,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:34:47,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:34:47,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:34:47,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:34:47,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:34:47,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:34:47,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:34:47,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:34:47,798 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 -> bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 [2025-03-04 11:34:48,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:34:48,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:34:48,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:34:48,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:34:48,025 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:34:48,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2025-03-04 11:34:49,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c634a59/c225ca8fa14c44f1ac67c33da5add993/FLAG3eed48ca4 [2025-03-04 11:34:49,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:34:49,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2025-03-04 11:34:49,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c634a59/c225ca8fa14c44f1ac67c33da5add993/FLAG3eed48ca4 [2025-03-04 11:34:49,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c634a59/c225ca8fa14c44f1ac67c33da5add993 [2025-03-04 11:34:49,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:34:49,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:34:49,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:34:49,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:34:49,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:34:49,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcc66c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49, skipping insertion in model container [2025-03-04 11:34:49,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:34:49,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:34:49,538 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:34:49,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:34:49,591 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:34:49,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49 WrapperNode [2025-03-04 11:34:49,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:34:49,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:34:49,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:34:49,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:34:49,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,623 INFO L138 Inliner]: procedures = 32, calls = 39, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 281 [2025-03-04 11:34:49,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:34:49,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:34:49,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:34:49,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:34:49,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,646 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:34:49,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:34:49,658 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:34:49,658 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:34:49,658 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:34:49,659 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (1/1) ... [2025-03-04 11:34:49,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:34:49,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:49,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:34:49,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:34:49,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:34:49,696 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-04 11:34:49,697 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-04 11:34:49,697 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-04 11:34:49,697 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-04 11:34:49,697 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-04 11:34:49,697 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-04 11:34:49,697 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-04 11:34:49,697 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-04 11:34:49,697 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-04 11:34:49,697 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-04 11:34:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-04 11:34:49,698 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-04 11:34:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:34:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-04 11:34:49,698 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-04 11:34:49,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:34:49,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:34:49,760 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:34:49,762 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:34:50,050 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-04 11:34:50,050 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:34:50,059 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:34:50,059 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:34:50,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:34:50 BoogieIcfgContainer [2025-03-04 11:34:50,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:34:50,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:34:50,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:34:50,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:34:50,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:34:49" (1/3) ... [2025-03-04 11:34:50,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7336e0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:34:50, skipping insertion in model container [2025-03-04 11:34:50,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:49" (2/3) ... [2025-03-04 11:34:50,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7336e0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:34:50, skipping insertion in model container [2025-03-04 11:34:50,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:34:50" (3/3) ... [2025-03-04 11:34:50,070 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2025-03-04 11:34:50,082 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:34:50,083 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.02.cil-2.c that has 8 procedures, 156 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-03-04 11:34:50,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:34:50,143 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;@469473b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:34:50,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:34:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 124 states have (on average 1.532258064516129) internal successors, (190), 133 states have internal predecessors, (190), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 11:34:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:50,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:50,156 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-04 11:34:50,157 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-04 11:34:50,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1557279412, now seen corresponding path program 1 times [2025-03-04 11:34:50,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:50,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971341724] [2025-03-04 11:34:50,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:50,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:50,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:50,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:50,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:50,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971341724] [2025-03-04 11:34:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971341724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:50,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:50,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49173285] [2025-03-04 11:34:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:50,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:50,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:50,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:50,560 INFO L87 Difference]: Start difference. First operand has 156 states, 124 states have (on average 1.532258064516129) internal successors, (190), 133 states have internal predecessors, (190), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:51,043 INFO L93 Difference]: Finished difference Result 458 states and 681 transitions. [2025-03-04 11:34:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:51,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:51,054 INFO L225 Difference]: With dead ends: 458 [2025-03-04 11:34:51,054 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 11:34:51,057 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-04 11:34:51,058 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 323 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:51,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1193 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:34:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 11:34:51,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 280. [2025-03-04 11:34:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 231 states have (on average 1.5021645021645023) internal successors, (347), 239 states have internal predecessors, (347), 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-04 11:34:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 412 transitions. [2025-03-04 11:34:51,114 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 412 transitions. Word has length 66 [2025-03-04 11:34:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:51,114 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 412 transitions. [2025-03-04 11:34:51,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 412 transitions. [2025-03-04 11:34:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:51,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:51,117 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-04 11:34:51,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:34:51,117 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-04 11:34:51,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:51,118 INFO L85 PathProgramCache]: Analyzing trace with hash 812154573, now seen corresponding path program 1 times [2025-03-04 11:34:51,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:51,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834959408] [2025-03-04 11:34:51,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:51,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:51,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:51,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:51,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:51,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834959408] [2025-03-04 11:34:51,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834959408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:51,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:51,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:51,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984142631] [2025-03-04 11:34:51,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:51,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:51,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:51,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:51,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:51,252 INFO L87 Difference]: Start difference. First operand 280 states and 412 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:51,623 INFO L93 Difference]: Finished difference Result 827 states and 1226 transitions. [2025-03-04 11:34:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:51,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:51,628 INFO L225 Difference]: With dead ends: 827 [2025-03-04 11:34:51,628 INFO L226 Difference]: Without dead ends: 559 [2025-03-04 11:34:51,629 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-04 11:34:51,629 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 311 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1039 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-04 11:34:51,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1039 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:34:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-04 11:34:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 538. [2025-03-04 11:34:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 451 states have (on average 1.498891352549889) internal successors, (676), 463 states have internal predecessors, (676), 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-04 11:34:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 801 transitions. [2025-03-04 11:34:51,671 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 801 transitions. Word has length 66 [2025-03-04 11:34:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:51,671 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 801 transitions. [2025-03-04 11:34:51,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 801 transitions. [2025-03-04 11:34:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:51,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:51,673 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-04 11:34:51,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:34:51,673 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-04 11:34:51,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1581324588, now seen corresponding path program 1 times [2025-03-04 11:34:51,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:51,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145831155] [2025-03-04 11:34:51,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:51,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:51,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:51,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:51,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145831155] [2025-03-04 11:34:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145831155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:51,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54585950] [2025-03-04 11:34:51,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:51,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:51,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:51,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:51,763 INFO L87 Difference]: Start difference. First operand 538 states and 801 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:52,098 INFO L93 Difference]: Finished difference Result 1702 states and 2558 transitions. [2025-03-04 11:34:52,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:52,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:52,104 INFO L225 Difference]: With dead ends: 1702 [2025-03-04 11:34:52,104 INFO L226 Difference]: Without dead ends: 1176 [2025-03-04 11:34:52,105 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-04 11:34:52,106 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 381 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:52,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1015 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:34:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-03-04 11:34:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1058. [2025-03-04 11:34:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 893 states have (on average 1.4938409854423291) internal successors, (1334), 919 states have internal predecessors, (1334), 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-04 11:34:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1595 transitions. [2025-03-04 11:34:52,190 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1595 transitions. Word has length 66 [2025-03-04 11:34:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:52,190 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1595 transitions. [2025-03-04 11:34:52,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1595 transitions. [2025-03-04 11:34:52,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:52,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:52,192 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-04 11:34:52,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:34:52,192 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-04 11:34:52,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1580452115, now seen corresponding path program 1 times [2025-03-04 11:34:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:52,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631130933] [2025-03-04 11:34:52,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:52,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:52,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:52,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:52,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631130933] [2025-03-04 11:34:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631130933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:52,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250464951] [2025-03-04 11:34:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:52,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:52,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:52,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:52,264 INFO L87 Difference]: Start difference. First operand 1058 states and 1595 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), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:52,417 INFO L93 Difference]: Finished difference Result 2187 states and 3353 transitions. [2025-03-04 11:34:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:52,417 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), 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 66 [2025-03-04 11:34:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:52,422 INFO L225 Difference]: With dead ends: 2187 [2025-03-04 11:34:52,422 INFO L226 Difference]: Without dead ends: 1139 [2025-03-04 11:34:52,424 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-04 11:34:52,425 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 242 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 387 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-04 11:34:52,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 387 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-03-04 11:34:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1058. [2025-03-04 11:34:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 893 states have (on average 1.4837625979843225) internal successors, (1325), 919 states have internal predecessors, (1325), 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-04 11:34:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1586 transitions. [2025-03-04 11:34:52,499 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1586 transitions. Word has length 66 [2025-03-04 11:34:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:52,499 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1586 transitions. [2025-03-04 11:34:52,500 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), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1586 transitions. [2025-03-04 11:34:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:52,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:52,501 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-04 11:34:52,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:34:52,501 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-04 11:34:52,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:52,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1820992244, now seen corresponding path program 1 times [2025-03-04 11:34:52,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:52,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30568027] [2025-03-04 11:34:52,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:52,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:52,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:52,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:52,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:52,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:52,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:52,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30568027] [2025-03-04 11:34:52,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30568027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:52,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:52,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:52,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959001323] [2025-03-04 11:34:52,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:52,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:52,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:52,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:52,571 INFO L87 Difference]: Start difference. First operand 1058 states and 1586 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:52,922 INFO L93 Difference]: Finished difference Result 3242 states and 4932 transitions. [2025-03-04 11:34:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:52,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:52,930 INFO L225 Difference]: With dead ends: 3242 [2025-03-04 11:34:52,930 INFO L226 Difference]: Without dead ends: 2196 [2025-03-04 11:34:52,932 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-04 11:34:52,933 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 308 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:52,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 986 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2025-03-04 11:34:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2100. [2025-03-04 11:34:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 1765 states have (on average 1.4679886685552408) internal successors, (2591), 1837 states have internal predecessors, (2591), 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-04 11:34:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3212 transitions. [2025-03-04 11:34:53,053 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3212 transitions. Word has length 66 [2025-03-04 11:34:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:53,053 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 3212 transitions. [2025-03-04 11:34:53,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3212 transitions. [2025-03-04 11:34:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:53,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:53,059 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-04 11:34:53,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:34:53,059 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-04 11:34:53,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1828751603, now seen corresponding path program 1 times [2025-03-04 11:34:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415288994] [2025-03-04 11:34:53,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:53,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:53,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415288994] [2025-03-04 11:34:53,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415288994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:53,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676553044] [2025-03-04 11:34:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:53,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:53,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:53,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:53,115 INFO L87 Difference]: Start difference. First operand 2100 states and 3212 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-04 11:34:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:53,351 INFO L93 Difference]: Finished difference Result 6080 states and 9374 transitions. [2025-03-04 11:34:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-04 11:34:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:53,368 INFO L225 Difference]: With dead ends: 6080 [2025-03-04 11:34:53,368 INFO L226 Difference]: Without dead ends: 3992 [2025-03-04 11:34:53,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:53,374 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 340 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 671 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-04 11:34:53,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 671 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3992 states. [2025-03-04 11:34:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3992 to 3972. [2025-03-04 11:34:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3314 states have (on average 1.4348219674109837) internal successors, (4755), 3468 states have internal predecessors, (4755), 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-04 11:34:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 5954 transitions. [2025-03-04 11:34:53,570 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 5954 transitions. Word has length 66 [2025-03-04 11:34:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:53,570 INFO L471 AbstractCegarLoop]: Abstraction has 3972 states and 5954 transitions. [2025-03-04 11:34:53,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-04 11:34:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 5954 transitions. [2025-03-04 11:34:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 11:34:53,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:53,574 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, 1] [2025-03-04 11:34:53,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:34:53,574 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-04 11:34:53,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash -513831698, now seen corresponding path program 1 times [2025-03-04 11:34:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603778067] [2025-03-04 11:34:53,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:53,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 11:34:53,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:34:53,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:53,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:53,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:53,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603778067] [2025-03-04 11:34:53,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603778067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:53,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:53,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892973873] [2025-03-04 11:34:53,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:53,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:53,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:53,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:53,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:53,633 INFO L87 Difference]: Start difference. First operand 3972 states and 5954 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:53,783 INFO L93 Difference]: Finished difference Result 7980 states and 12084 transitions. [2025-03-04 11:34:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:53,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2025-03-04 11:34:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:53,803 INFO L225 Difference]: With dead ends: 7980 [2025-03-04 11:34:53,803 INFO L226 Difference]: Without dead ends: 4020 [2025-03-04 11:34:53,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:53,813 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:53,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 806 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2025-03-04 11:34:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 4020. [2025-03-04 11:34:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4020 states, 3362 states have (on average 1.4238548483045805) internal successors, (4787), 3516 states have internal predecessors, (4787), 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-04 11:34:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 5986 transitions. [2025-03-04 11:34:54,037 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 5986 transitions. Word has length 67 [2025-03-04 11:34:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:54,037 INFO L471 AbstractCegarLoop]: Abstraction has 4020 states and 5986 transitions. [2025-03-04 11:34:54,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 5986 transitions. [2025-03-04 11:34:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 11:34:54,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:54,040 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, 1] [2025-03-04 11:34:54,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:34:54,040 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-04 11:34:54,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1845475311, now seen corresponding path program 1 times [2025-03-04 11:34:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910090569] [2025-03-04 11:34:54,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:54,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 11:34:54,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:34:54,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:54,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:54,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910090569] [2025-03-04 11:34:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910090569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:54,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:54,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:54,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947105004] [2025-03-04 11:34:54,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:54,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:54,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:54,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:54,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:54,078 INFO L87 Difference]: Start difference. First operand 4020 states and 5986 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:54,401 INFO L93 Difference]: Finished difference Result 11904 states and 17792 transitions. [2025-03-04 11:34:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:54,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 67 [2025-03-04 11:34:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:54,439 INFO L225 Difference]: With dead ends: 11904 [2025-03-04 11:34:54,440 INFO L226 Difference]: Without dead ends: 7896 [2025-03-04 11:34:54,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:54,451 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 356 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 685 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-04 11:34:54,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 685 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7896 states. [2025-03-04 11:34:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7896 to 7796. [2025-03-04 11:34:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7796 states, 6508 states have (on average 1.4128764597418562) internal successors, (9195), 6810 states have internal predecessors, (9195), 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-04 11:34:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 11518 transitions. [2025-03-04 11:34:54,880 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 11518 transitions. Word has length 67 [2025-03-04 11:34:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:54,880 INFO L471 AbstractCegarLoop]: Abstraction has 7796 states and 11518 transitions. [2025-03-04 11:34:54,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 11518 transitions. [2025-03-04 11:34:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:34:54,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:54,884 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, 1, 1] [2025-03-04 11:34:54,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:34:54,884 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-04 11:34:54,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash 394745616, now seen corresponding path program 1 times [2025-03-04 11:34:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:54,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653660171] [2025-03-04 11:34:54,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:54,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:34:54,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:34:54,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:54,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653660171] [2025-03-04 11:34:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653660171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:54,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:54,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808907439] [2025-03-04 11:34:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:54,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:54,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:54,935 INFO L87 Difference]: Start difference. First operand 7796 states and 11518 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:55,292 INFO L93 Difference]: Finished difference Result 15676 states and 23390 transitions. [2025-03-04 11:34:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-04 11:34:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:55,333 INFO L225 Difference]: With dead ends: 15676 [2025-03-04 11:34:55,333 INFO L226 Difference]: Without dead ends: 7892 [2025-03-04 11:34:55,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:55,348 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:55,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 806 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2025-03-04 11:34:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7892. [2025-03-04 11:34:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7892 states, 6604 states have (on average 1.4020290732889158) internal successors, (9259), 6906 states have internal predecessors, (9259), 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-04 11:34:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7892 states to 7892 states and 11582 transitions. [2025-03-04 11:34:55,692 INFO L78 Accepts]: Start accepts. Automaton has 7892 states and 11582 transitions. Word has length 68 [2025-03-04 11:34:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:55,693 INFO L471 AbstractCegarLoop]: Abstraction has 7892 states and 11582 transitions. [2025-03-04 11:34:55,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7892 states and 11582 transitions. [2025-03-04 11:34:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:34:55,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:55,696 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, 1, 1] [2025-03-04 11:34:55,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:34:55,697 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-04 11:34:55,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1949921425, now seen corresponding path program 1 times [2025-03-04 11:34:55,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:55,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704662842] [2025-03-04 11:34:55,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:55,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:55,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:34:55,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:34:55,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:55,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:55,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:55,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704662842] [2025-03-04 11:34:55,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704662842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:55,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636681283] [2025-03-04 11:34:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:55,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:55,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:55,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:55,746 INFO L87 Difference]: Start difference. First operand 7892 states and 11582 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:56,366 INFO L93 Difference]: Finished difference Result 26602 states and 39250 transitions. [2025-03-04 11:34:56,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:56,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-04 11:34:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:56,436 INFO L225 Difference]: With dead ends: 26602 [2025-03-04 11:34:56,436 INFO L226 Difference]: Without dead ends: 18052 [2025-03-04 11:34:56,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:34:56,464 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 694 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 811 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-04 11:34:56,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 811 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18052 states. [2025-03-04 11:34:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18052 to 15679. [2025-03-04 11:34:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15679 states, 13095 states have (on average 1.3993127147766322) internal successors, (18324), 13720 states have internal predecessors, (18324), 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-04 11:34:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15679 states to 15679 states and 22961 transitions. [2025-03-04 11:34:57,488 INFO L78 Accepts]: Start accepts. Automaton has 15679 states and 22961 transitions. Word has length 68 [2025-03-04 11:34:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:57,489 INFO L471 AbstractCegarLoop]: Abstraction has 15679 states and 22961 transitions. [2025-03-04 11:34:57,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 15679 states and 22961 transitions. [2025-03-04 11:34:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:34:57,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:57,495 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, 1, 1, 1] [2025-03-04 11:34:57,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:34:57,495 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-04 11:34:57,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash -538917580, now seen corresponding path program 1 times [2025-03-04 11:34:57,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:57,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829574029] [2025-03-04 11:34:57,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:57,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:57,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:34:57,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:34:57,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:57,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:57,593 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-04 11:34:57,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829574029] [2025-03-04 11:34:57,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829574029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:57,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:57,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:57,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398126926] [2025-03-04 11:34:57,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:57,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:57,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:57,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:57,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:57,595 INFO L87 Difference]: Start difference. First operand 15679 states and 22961 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:57,982 INFO L93 Difference]: Finished difference Result 31634 states and 46826 transitions. [2025-03-04 11:34:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 86 [2025-03-04 11:34:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:58,045 INFO L225 Difference]: With dead ends: 31634 [2025-03-04 11:34:58,045 INFO L226 Difference]: Without dead ends: 15967 [2025-03-04 11:34:58,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:58,079 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:58,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 806 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15967 states. [2025-03-04 11:34:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15967 to 15967. [2025-03-04 11:34:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15967 states, 13383 states have (on average 1.3859373832474033) internal successors, (18548), 14008 states have internal predecessors, (18548), 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-04 11:34:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15967 states to 15967 states and 23185 transitions. [2025-03-04 11:34:58,693 INFO L78 Accepts]: Start accepts. Automaton has 15967 states and 23185 transitions. Word has length 86 [2025-03-04 11:34:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:58,693 INFO L471 AbstractCegarLoop]: Abstraction has 15967 states and 23185 transitions. [2025-03-04 11:34:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 15967 states and 23185 transitions. [2025-03-04 11:34:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:34:58,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:58,699 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, 1, 1, 1] [2025-03-04 11:34:58,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:34:58,699 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-04 11:34:58,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:58,700 INFO L85 PathProgramCache]: Analyzing trace with hash 430663443, now seen corresponding path program 1 times [2025-03-04 11:34:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:58,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057926982] [2025-03-04 11:34:58,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:58,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:34:58,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:34:58,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:58,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:58,757 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-04 11:34:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057926982] [2025-03-04 11:34:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057926982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:58,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:58,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256756033] [2025-03-04 11:34:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:58,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:58,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:58,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:58,758 INFO L87 Difference]: Start difference. First operand 15967 states and 23185 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-04 11:34:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:59,345 INFO L93 Difference]: Finished difference Result 18999 states and 27556 transitions. [2025-03-04 11:34:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:59,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 86 [2025-03-04 11:34:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:59,396 INFO L225 Difference]: With dead ends: 18999 [2025-03-04 11:34:59,397 INFO L226 Difference]: Without dead ends: 17430 [2025-03-04 11:34:59,406 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-04 11:34:59,406 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 306 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 553 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-04 11:34:59,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 553 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17430 states. [2025-03-04 11:35:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17430 to 16869. [2025-03-04 11:35:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16869 states, 14152 states have (on average 1.368216506500848) internal successors, (19363), 14783 states have internal predecessors, (19363), 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-04 11:35:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16869 states to 16869 states and 24030 transitions. [2025-03-04 11:35:00,410 INFO L78 Accepts]: Start accepts. Automaton has 16869 states and 24030 transitions. Word has length 86 [2025-03-04 11:35:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:00,411 INFO L471 AbstractCegarLoop]: Abstraction has 16869 states and 24030 transitions. [2025-03-04 11:35:00,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-04 11:35:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 16869 states and 24030 transitions. [2025-03-04 11:35:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:00,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:00,418 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, 1, 1, 1] [2025-03-04 11:35:00,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 11:35:00,418 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-04 11:35:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -594030478, now seen corresponding path program 1 times [2025-03-04 11:35:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909867943] [2025-03-04 11:35:00,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:00,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:00,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:00,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:00,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:00,535 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-04 11:35:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909867943] [2025-03-04 11:35:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909867943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754644725] [2025-03-04 11:35:00,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:00,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:00,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:00,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:00,536 INFO L87 Difference]: Start difference. First operand 16869 states and 24030 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 11:35:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:01,161 INFO L93 Difference]: Finished difference Result 19691 states and 27988 transitions. [2025-03-04 11:35:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:35:01,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 86 [2025-03-04 11:35:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:01,197 INFO L225 Difference]: With dead ends: 19691 [2025-03-04 11:35:01,197 INFO L226 Difference]: Without dead ends: 10218 [2025-03-04 11:35:01,212 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-04 11:35:01,213 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 306 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 714 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-04 11:35:01,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 714 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10218 states. [2025-03-04 11:35:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10218 to 9501. [2025-03-04 11:35:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9501 states, 8029 states have (on average 1.348611284095155) internal successors, (10828), 8250 states have internal predecessors, (10828), 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-04 11:35:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9501 states to 9501 states and 12929 transitions. [2025-03-04 11:35:01,555 INFO L78 Accepts]: Start accepts. Automaton has 9501 states and 12929 transitions. Word has length 86 [2025-03-04 11:35:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:01,556 INFO L471 AbstractCegarLoop]: Abstraction has 9501 states and 12929 transitions. [2025-03-04 11:35:01,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 11:35:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 9501 states and 12929 transitions. [2025-03-04 11:35:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:01,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:01,558 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, 1, 1, 1] [2025-03-04 11:35:01,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:35:01,559 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-04 11:35:01,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1042727117, now seen corresponding path program 1 times [2025-03-04 11:35:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:01,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130560650] [2025-03-04 11:35:01,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:01,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:01,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:01,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:01,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:01,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:01,651 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-04 11:35:01,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:01,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130560650] [2025-03-04 11:35:01,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130560650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:01,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:01,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937640431] [2025-03-04 11:35:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:01,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:01,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:01,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:01,652 INFO L87 Difference]: Start difference. First operand 9501 states and 12929 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 11:35:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:02,032 INFO L93 Difference]: Finished difference Result 11951 states and 16365 transitions. [2025-03-04 11:35:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:35:02,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 86 [2025-03-04 11:35:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:02,050 INFO L225 Difference]: With dead ends: 11951 [2025-03-04 11:35:02,050 INFO L226 Difference]: Without dead ends: 6018 [2025-03-04 11:35:02,059 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-04 11:35:02,059 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 298 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 706 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-04 11:35:02,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 706 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:02,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2025-03-04 11:35:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 5673. [2025-03-04 11:35:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5673 states, 4819 states have (on average 1.3446773189458394) internal successors, (6480), 4904 states have internal predecessors, (6480), 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-04 11:35:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5673 states to 5673 states and 7597 transitions. [2025-03-04 11:35:02,229 INFO L78 Accepts]: Start accepts. Automaton has 5673 states and 7597 transitions. Word has length 86 [2025-03-04 11:35:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:02,230 INFO L471 AbstractCegarLoop]: Abstraction has 5673 states and 7597 transitions. [2025-03-04 11:35:02,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 11:35:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5673 states and 7597 transitions. [2025-03-04 11:35:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:02,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:02,232 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, 1, 1, 1] [2025-03-04 11:35:02,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:35:02,233 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-04 11:35:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash -918653870, now seen corresponding path program 1 times [2025-03-04 11:35:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:02,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690130] [2025-03-04 11:35:02,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:02,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:02,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:02,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:02,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:02,323 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-04 11:35:02,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:02,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690130] [2025-03-04 11:35:02,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:02,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:02,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:02,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267972592] [2025-03-04 11:35:02,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:02,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:02,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:02,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:02,324 INFO L87 Difference]: Start difference. First operand 5673 states and 7597 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 11:35:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:02,728 INFO L93 Difference]: Finished difference Result 9281 states and 12526 transitions. [2025-03-04 11:35:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:35:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 86 [2025-03-04 11:35:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:02,747 INFO L225 Difference]: With dead ends: 9281 [2025-03-04 11:35:02,747 INFO L226 Difference]: Without dead ends: 5342 [2025-03-04 11:35:02,755 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-04 11:35:02,755 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 313 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 693 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-04 11:35:02,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 693 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2025-03-04 11:35:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 4743. [2025-03-04 11:35:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4743 states, 4044 states have (on average 1.345944609297725) internal successors, (5443), 4093 states have internal predecessors, (5443), 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-04 11:35:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4743 states to 4743 states and 6328 transitions. [2025-03-04 11:35:02,949 INFO L78 Accepts]: Start accepts. Automaton has 4743 states and 6328 transitions. Word has length 86 [2025-03-04 11:35:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:02,950 INFO L471 AbstractCegarLoop]: Abstraction has 4743 states and 6328 transitions. [2025-03-04 11:35:02,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 11:35:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4743 states and 6328 transitions. [2025-03-04 11:35:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:02,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:02,951 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, 1, 1, 1] [2025-03-04 11:35:02,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:35:02,951 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-04 11:35:02,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1440653139, now seen corresponding path program 1 times [2025-03-04 11:35:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707482409] [2025-03-04 11:35:02,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:02,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:02,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:02,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:02,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:02,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:03,019 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-04 11:35:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:03,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707482409] [2025-03-04 11:35:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707482409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:03,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:35:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480303769] [2025-03-04 11:35:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:03,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:35:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:03,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:35:03,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:03,020 INFO L87 Difference]: Start difference. First operand 4743 states and 6328 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-04 11:35:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:03,321 INFO L93 Difference]: Finished difference Result 10940 states and 14474 transitions. [2025-03-04 11:35:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:03,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 86 [2025-03-04 11:35:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:03,339 INFO L225 Difference]: With dead ends: 10940 [2025-03-04 11:35:03,340 INFO L226 Difference]: Without dead ends: 6209 [2025-03-04 11:35:03,348 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-04 11:35:03,348 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 264 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 377 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-04 11:35:03,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 377 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2025-03-04 11:35:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 5667. [2025-03-04 11:35:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5667 states, 4896 states have (on average 1.2939133986928104) internal successors, (6335), 4941 states have internal predecessors, (6335), 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-04 11:35:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5667 states to 5667 states and 7287 transitions. [2025-03-04 11:35:03,523 INFO L78 Accepts]: Start accepts. Automaton has 5667 states and 7287 transitions. Word has length 86 [2025-03-04 11:35:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:03,524 INFO L471 AbstractCegarLoop]: Abstraction has 5667 states and 7287 transitions. [2025-03-04 11:35:03,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-04 11:35:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5667 states and 7287 transitions. [2025-03-04 11:35:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:03,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:03,525 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, 1, 1, 1] [2025-03-04 11:35:03,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:35:03,526 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-04 11:35:03,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1392734158, now seen corresponding path program 1 times [2025-03-04 11:35:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304755392] [2025-03-04 11:35:03,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:03,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:03,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:03,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:03,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:03,598 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-04 11:35:03,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304755392] [2025-03-04 11:35:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304755392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:03,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:03,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257460563] [2025-03-04 11:35:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:03,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:03,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:03,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:03,599 INFO L87 Difference]: Start difference. First operand 5667 states and 7287 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 11:35:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:03,970 INFO L93 Difference]: Finished difference Result 9413 states and 12175 transitions. [2025-03-04 11:35:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:35:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 86 [2025-03-04 11:35:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:03,986 INFO L225 Difference]: With dead ends: 9413 [2025-03-04 11:35:03,986 INFO L226 Difference]: Without dead ends: 5324 [2025-03-04 11:35:03,991 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-04 11:35:03,991 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 280 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 671 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-04 11:35:03,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 671 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2025-03-04 11:35:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 4918. [2025-03-04 11:35:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4918 states, 4256 states have (on average 1.2979323308270676) internal successors, (5524), 4286 states have internal predecessors, (5524), 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-04 11:35:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4918 states to 4918 states and 6340 transitions. [2025-03-04 11:35:04,135 INFO L78 Accepts]: Start accepts. Automaton has 4918 states and 6340 transitions. Word has length 86 [2025-03-04 11:35:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:04,136 INFO L471 AbstractCegarLoop]: Abstraction has 4918 states and 6340 transitions. [2025-03-04 11:35:04,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 11:35:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4918 states and 6340 transitions. [2025-03-04 11:35:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:04,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:04,137 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, 1, 1, 1] [2025-03-04 11:35:04,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:35:04,137 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-04 11:35:04,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:04,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1979549555, now seen corresponding path program 1 times [2025-03-04 11:35:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239142223] [2025-03-04 11:35:04,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:04,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:04,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:04,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:04,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:35:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239142223] [2025-03-04 11:35:04,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239142223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:04,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:04,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062528010] [2025-03-04 11:35:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:04,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:04,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:04,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:04,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:04,171 INFO L87 Difference]: Start difference. First operand 4918 states and 6340 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-04 11:35:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:04,519 INFO L93 Difference]: Finished difference Result 14077 states and 18340 transitions. [2025-03-04 11:35:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:04,519 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-04 11:35:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:04,540 INFO L225 Difference]: With dead ends: 14077 [2025-03-04 11:35:04,540 INFO L226 Difference]: Without dead ends: 9171 [2025-03-04 11:35:04,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:04,548 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 246 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:04,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 512 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9171 states. [2025-03-04 11:35:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9171 to 8863. [2025-03-04 11:35:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8863 states, 7632 states have (on average 1.2872117400419287) internal successors, (9824), 7697 states have internal predecessors, (9824), 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-04 11:35:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8863 states to 8863 states and 11481 transitions. [2025-03-04 11:35:04,816 INFO L78 Accepts]: Start accepts. Automaton has 8863 states and 11481 transitions. Word has length 86 [2025-03-04 11:35:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:04,817 INFO L471 AbstractCegarLoop]: Abstraction has 8863 states and 11481 transitions. [2025-03-04 11:35:04,817 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-04 11:35:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 8863 states and 11481 transitions. [2025-03-04 11:35:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 11:35:04,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:04,818 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, 1] [2025-03-04 11:35:04,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:35:04,818 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-04 11:35:04,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:04,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1682008810, now seen corresponding path program 1 times [2025-03-04 11:35:04,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:04,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14170913] [2025-03-04 11:35:04,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:04,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:04,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:35:04,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:35:04,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:04,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:04,840 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-04 11:35:04,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:04,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14170913] [2025-03-04 11:35:04,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14170913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:04,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:04,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116571969] [2025-03-04 11:35:04,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:04,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:04,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:04,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:04,842 INFO L87 Difference]: Start difference. First operand 8863 states and 11481 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, (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-04 11:35:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:05,028 INFO L93 Difference]: Finished difference Result 16231 states and 20917 transitions. [2025-03-04 11:35:05,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:05,028 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, (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 88 [2025-03-04 11:35:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:05,054 INFO L225 Difference]: With dead ends: 16231 [2025-03-04 11:35:05,054 INFO L226 Difference]: Without dead ends: 7380 [2025-03-04 11:35:05,067 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-04 11:35:05,068 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 198 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 202 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-04 11:35:05,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 202 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7380 states. [2025-03-04 11:35:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7380 to 7220. [2025-03-04 11:35:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7220 states, 6240 states have (on average 1.2810897435897435) internal successors, (7994), 6300 states have internal predecessors, (7994), 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-04 11:35:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 9276 transitions. [2025-03-04 11:35:05,361 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 9276 transitions. Word has length 88 [2025-03-04 11:35:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:05,362 INFO L471 AbstractCegarLoop]: Abstraction has 7220 states and 9276 transitions. [2025-03-04 11:35:05,363 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, (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-04 11:35:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 9276 transitions. [2025-03-04 11:35:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:35:05,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:05,363 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, 1, 1, 1, 1] [2025-03-04 11:35:05,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 11:35:05,364 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-04 11:35:05,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1156433651, now seen corresponding path program 1 times [2025-03-04 11:35:05,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:05,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728572466] [2025-03-04 11:35:05,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:05,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:05,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:35:05,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:35:05,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:05,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:05,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:05,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728572466] [2025-03-04 11:35:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728572466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:05,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:05,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511065319] [2025-03-04 11:35:05,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:05,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:05,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:05,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:05,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:05,399 INFO L87 Difference]: Start difference. First operand 7220 states and 9276 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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-04 11:35:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:05,905 INFO L93 Difference]: Finished difference Result 21553 states and 27700 transitions. [2025-03-04 11:35:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:05,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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-04 11:35:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:05,947 INFO L225 Difference]: With dead ends: 21553 [2025-03-04 11:35:05,947 INFO L226 Difference]: Without dead ends: 14345 [2025-03-04 11:35:05,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:05,962 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 228 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 461 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-04 11:35:05,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 461 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14345 states. [2025-03-04 11:35:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14345 to 14244. [2025-03-04 11:35:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14244 states, 12204 states have (on average 1.264667322189446) internal successors, (15434), 12404 states have internal predecessors, (15434), 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-04 11:35:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14244 states to 14244 states and 18213 transitions. [2025-03-04 11:35:06,622 INFO L78 Accepts]: Start accepts. Automaton has 14244 states and 18213 transitions. Word has length 90 [2025-03-04 11:35:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:06,623 INFO L471 AbstractCegarLoop]: Abstraction has 14244 states and 18213 transitions. [2025-03-04 11:35:06,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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-04 11:35:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 14244 states and 18213 transitions. [2025-03-04 11:35:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:35:06,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:06,624 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, 1, 1, 1, 1] [2025-03-04 11:35:06,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 11:35:06,625 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-04 11:35:06,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash 627514612, now seen corresponding path program 1 times [2025-03-04 11:35:06,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:06,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303903931] [2025-03-04 11:35:06,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:06,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:35:06,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:35:06,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:06,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:06,648 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-04 11:35:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303903931] [2025-03-04 11:35:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303903931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424409674] [2025-03-04 11:35:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:06,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:06,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:06,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:06,651 INFO L87 Difference]: Start difference. First operand 14244 states and 18213 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 11:35:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:07,315 INFO L93 Difference]: Finished difference Result 25544 states and 32637 transitions. [2025-03-04 11:35:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:07,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 90 [2025-03-04 11:35:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:07,360 INFO L225 Difference]: With dead ends: 25544 [2025-03-04 11:35:07,360 INFO L226 Difference]: Without dead ends: 11312 [2025-03-04 11:35:07,384 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-04 11:35:07,385 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 201 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-04 11:35:07,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 201 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2025-03-04 11:35:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 11312. [2025-03-04 11:35:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11312 states, 9724 states have (on average 1.2658371040723981) internal successors, (12309), 9870 states have internal predecessors, (12309), 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-04 11:35:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11312 states to 11312 states and 14441 transitions. [2025-03-04 11:35:07,886 INFO L78 Accepts]: Start accepts. Automaton has 11312 states and 14441 transitions. Word has length 90 [2025-03-04 11:35:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:07,886 INFO L471 AbstractCegarLoop]: Abstraction has 11312 states and 14441 transitions. [2025-03-04 11:35:07,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 11:35:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11312 states and 14441 transitions. [2025-03-04 11:35:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:35:07,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:07,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:07,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:35:07,887 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-04 11:35:07,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -595035051, now seen corresponding path program 1 times [2025-03-04 11:35:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977040683] [2025-03-04 11:35:07,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:07,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 11:35:07,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:35:07,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:07,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:35:07,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977040683] [2025-03-04 11:35:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977040683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:07,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:07,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406105382] [2025-03-04 11:35:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:07,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:07,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:07,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:07,918 INFO L87 Difference]: Start difference. First operand 11312 states and 14441 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-04 11:35:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:08,688 INFO L93 Difference]: Finished difference Result 33650 states and 42944 transitions. [2025-03-04 11:35:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:08,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 91 [2025-03-04 11:35:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:08,750 INFO L225 Difference]: With dead ends: 33650 [2025-03-04 11:35:08,750 INFO L226 Difference]: Without dead ends: 22350 [2025-03-04 11:35:08,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:08,775 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 238 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 543 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-04 11:35:08,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 543 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22350 states. [2025-03-04 11:35:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22350 to 22284. [2025-03-04 11:35:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22284 states, 19135 states have (on average 1.254768748366867) internal successors, (24010), 19468 states have internal predecessors, (24010), 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-04 11:35:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 28216 transitions. [2025-03-04 11:35:09,642 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 28216 transitions. Word has length 91 [2025-03-04 11:35:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:09,643 INFO L471 AbstractCegarLoop]: Abstraction has 22284 states and 28216 transitions. [2025-03-04 11:35:09,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-04 11:35:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 28216 transitions. [2025-03-04 11:35:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:35:09,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:09,644 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:09,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:35:09,644 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-04 11:35:09,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2080090602, now seen corresponding path program 1 times [2025-03-04 11:35:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304452953] [2025-03-04 11:35:09,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:09,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:09,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 11:35:09,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:35:09,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:09,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:35:09,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:09,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304452953] [2025-03-04 11:35:09,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304452953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:09,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:09,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:09,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002397089] [2025-03-04 11:35:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:09,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:09,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:09,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:09,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:09,662 INFO L87 Difference]: Start difference. First operand 22284 states and 28216 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 11:35:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:10,232 INFO L93 Difference]: Finished difference Result 40404 states and 51160 transitions. [2025-03-04 11:35:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 91 [2025-03-04 11:35:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:10,290 INFO L225 Difference]: With dead ends: 40404 [2025-03-04 11:35:10,290 INFO L226 Difference]: Without dead ends: 18132 [2025-03-04 11:35:10,323 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-04 11:35:10,324 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 200 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-04 11:35:10,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18132 states. [2025-03-04 11:35:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18132 to 18132. [2025-03-04 11:35:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18132 states, 15582 states have (on average 1.2550378642022846) internal successors, (19556), 15857 states have internal predecessors, (19556), 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-04 11:35:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18132 states to 18132 states and 22960 transitions. [2025-03-04 11:35:11,085 INFO L78 Accepts]: Start accepts. Automaton has 18132 states and 22960 transitions. Word has length 91 [2025-03-04 11:35:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:11,085 INFO L471 AbstractCegarLoop]: Abstraction has 18132 states and 22960 transitions. [2025-03-04 11:35:11,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 11:35:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18132 states and 22960 transitions. [2025-03-04 11:35:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 11:35:11,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:11,086 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, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:11,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 11:35:11,086 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-04 11:35:11,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:11,086 INFO L85 PathProgramCache]: Analyzing trace with hash 671874825, now seen corresponding path program 1 times [2025-03-04 11:35:11,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:11,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47674646] [2025-03-04 11:35:11,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:11,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:11,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 11:35:11,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 11:35:11,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:11,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:11,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:11,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47674646] [2025-03-04 11:35:11,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47674646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:11,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:11,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985306019] [2025-03-04 11:35:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:11,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:11,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:11,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:11,126 INFO L87 Difference]: Start difference. First operand 18132 states and 22960 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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-04 11:35:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:11,935 INFO L93 Difference]: Finished difference Result 29525 states and 37685 transitions. [2025-03-04 11:35:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:11,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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 92 [2025-03-04 11:35:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:11,981 INFO L225 Difference]: With dead ends: 29525 [2025-03-04 11:35:11,982 INFO L226 Difference]: Without dead ends: 15687 [2025-03-04 11:35:12,001 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-04 11:35:12,002 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 781 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 895 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-04 11:35:12,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 895 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15687 states. [2025-03-04 11:35:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15687 to 15071. [2025-03-04 11:35:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15071 states, 12983 states have (on average 1.2572594931833936) internal successors, (16323), 13208 states have internal predecessors, (16323), 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-04 11:35:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 19131 transitions. [2025-03-04 11:35:12,600 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 19131 transitions. Word has length 92 [2025-03-04 11:35:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:12,600 INFO L471 AbstractCegarLoop]: Abstraction has 15071 states and 19131 transitions. [2025-03-04 11:35:12,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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-04 11:35:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 19131 transitions. [2025-03-04 11:35:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 11:35:12,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:12,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:12,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 11:35:12,601 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-04 11:35:12,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash -405186539, now seen corresponding path program 1 times [2025-03-04 11:35:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:12,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445968972] [2025-03-04 11:35:12,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:12,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:35:12,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:35:12,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:12,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:12,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445968972] [2025-03-04 11:35:12,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445968972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:12,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:12,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:12,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838360998] [2025-03-04 11:35:12,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:12,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:12,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:12,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:12,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:12,644 INFO L87 Difference]: Start difference. First operand 15071 states and 19131 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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-04 11:35:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:13,440 INFO L93 Difference]: Finished difference Result 27089 states and 34386 transitions. [2025-03-04 11:35:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:13,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 95 [2025-03-04 11:35:13,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:13,491 INFO L225 Difference]: With dead ends: 27089 [2025-03-04 11:35:13,491 INFO L226 Difference]: Without dead ends: 15621 [2025-03-04 11:35:13,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:35:13,510 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 708 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1031 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:13,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1031 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15621 states. [2025-03-04 11:35:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15621 to 14970. [2025-03-04 11:35:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14970 states, 12890 states have (on average 1.2536074476338246) internal successors, (16159), 13115 states have internal predecessors, (16159), 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-04 11:35:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14970 states to 14970 states and 18938 transitions. [2025-03-04 11:35:14,412 INFO L78 Accepts]: Start accepts. Automaton has 14970 states and 18938 transitions. Word has length 95 [2025-03-04 11:35:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:14,413 INFO L471 AbstractCegarLoop]: Abstraction has 14970 states and 18938 transitions. [2025-03-04 11:35:14,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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-04 11:35:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 14970 states and 18938 transitions. [2025-03-04 11:35:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 11:35:14,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:14,414 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, 1, 1, 1, 1] [2025-03-04 11:35:14,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 11:35:14,414 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-04 11:35:14,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2136200802, now seen corresponding path program 1 times [2025-03-04 11:35:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:14,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269791037] [2025-03-04 11:35:14,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:14,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 11:35:14,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 11:35:14,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:14,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:14,438 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-04 11:35:14,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:14,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269791037] [2025-03-04 11:35:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269791037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:14,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:14,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584509093] [2025-03-04 11:35:14,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:14,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:14,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:14,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:14,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:14,440 INFO L87 Difference]: Start difference. First operand 14970 states and 18938 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-04 11:35:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:15,329 INFO L93 Difference]: Finished difference Result 28906 states and 36613 transitions. [2025-03-04 11:35:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 102 [2025-03-04 11:35:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:15,378 INFO L225 Difference]: With dead ends: 28906 [2025-03-04 11:35:15,378 INFO L226 Difference]: Without dead ends: 16947 [2025-03-04 11:35:15,397 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-04 11:35:15,398 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 150 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 415 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-04 11:35:15,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 415 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16947 states. [2025-03-04 11:35:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16947 to 14460. [2025-03-04 11:35:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14460 states, 12446 states have (on average 1.2443355294873855) internal successors, (15487), 12658 states have internal predecessors, (15487), 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-04 11:35:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14460 states to 14460 states and 18149 transitions. [2025-03-04 11:35:16,044 INFO L78 Accepts]: Start accepts. Automaton has 14460 states and 18149 transitions. Word has length 102 [2025-03-04 11:35:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:16,044 INFO L471 AbstractCegarLoop]: Abstraction has 14460 states and 18149 transitions. [2025-03-04 11:35:16,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-04 11:35:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 14460 states and 18149 transitions. [2025-03-04 11:35:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 11:35:16,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:16,046 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:16,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 11:35:16,046 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-04 11:35:16,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2006185641, now seen corresponding path program 1 times [2025-03-04 11:35:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:16,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584701985] [2025-03-04 11:35:16,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:16,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 11:35:16,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:35:16,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:16,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 11:35:16,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584701985] [2025-03-04 11:35:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584701985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:16,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:16,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:35:16,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822239019] [2025-03-04 11:35:16,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:16,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:35:16,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:16,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:35:16,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:35:16,145 INFO L87 Difference]: Start difference. First operand 14460 states and 18149 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 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-04 11:35:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:17,126 INFO L93 Difference]: Finished difference Result 27363 states and 34409 transitions. [2025-03-04 11:35:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:35:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 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 114 [2025-03-04 11:35:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:17,174 INFO L225 Difference]: With dead ends: 27363 [2025-03-04 11:35:17,174 INFO L226 Difference]: Without dead ends: 15829 [2025-03-04 11:35:17,193 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-04 11:35:17,193 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1275 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:17,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1078 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15829 states. [2025-03-04 11:35:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15829 to 14460. [2025-03-04 11:35:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14460 states, 12446 states have (on average 1.2374256789329905) internal successors, (15401), 12658 states have internal predecessors, (15401), 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-04 11:35:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14460 states to 14460 states and 17934 transitions. [2025-03-04 11:35:17,761 INFO L78 Accepts]: Start accepts. Automaton has 14460 states and 17934 transitions. Word has length 114 [2025-03-04 11:35:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:17,761 INFO L471 AbstractCegarLoop]: Abstraction has 14460 states and 17934 transitions. [2025-03-04 11:35:17,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 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-04 11:35:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14460 states and 17934 transitions. [2025-03-04 11:35:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 11:35:17,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:17,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:17,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 11:35:17,762 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-04 11:35:17,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1680896000, now seen corresponding path program 1 times [2025-03-04 11:35:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:17,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904269910] [2025-03-04 11:35:17,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:17,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 11:35:17,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 11:35:17,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:35:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:17,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904269910] [2025-03-04 11:35:17,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904269910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:17,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:17,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541646473] [2025-03-04 11:35:17,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:17,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:17,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:17,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:17,785 INFO L87 Difference]: Start difference. First operand 14460 states and 17934 transitions. Second operand has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 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-04 11:35:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:18,335 INFO L93 Difference]: Finished difference Result 14460 states and 17934 transitions. [2025-03-04 11:35:18,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:18,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 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 122 [2025-03-04 11:35:18,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:18,377 INFO L225 Difference]: With dead ends: 14460 [2025-03-04 11:35:18,377 INFO L226 Difference]: Without dead ends: 14458 [2025-03-04 11:35:18,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:18,381 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 192 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-04 11:35:18,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 192 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14458 states. [2025-03-04 11:35:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14458 to 14458. [2025-03-04 11:35:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14458 states, 12446 states have (on average 1.233408323959505) internal successors, (15351), 12656 states have internal predecessors, (15351), 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-04 11:35:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14458 states to 14458 states and 17884 transitions. [2025-03-04 11:35:18,989 INFO L78 Accepts]: Start accepts. Automaton has 14458 states and 17884 transitions. Word has length 122 [2025-03-04 11:35:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:18,989 INFO L471 AbstractCegarLoop]: Abstraction has 14458 states and 17884 transitions. [2025-03-04 11:35:18,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 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-04 11:35:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 14458 states and 17884 transitions. [2025-03-04 11:35:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 11:35:18,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:18,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:18,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 11:35:18,990 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-04 11:35:18,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash -568168322, now seen corresponding path program 1 times [2025-03-04 11:35:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997313302] [2025-03-04 11:35:18,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:18,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 11:35:18,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 11:35:18,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:18,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 11:35:18,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 11:35:19,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 11:35:19,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 11:35:19,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:19,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 11:35:19,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 11:35:19,033 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 11:35:19,034 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 11:35:19,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 11:35:19,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 11:35:19,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 11:35:19,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 11:35:19,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 11:35:19,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 11:35:19,038 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-04 11:35:19,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:35:19,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:35:19 BoogieIcfgContainer [2025-03-04 11:35:19,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:35:19,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:35:19,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:35:19,115 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:35:19,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:34:50" (3/4) ... [2025-03-04 11:35:19,118 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 11:35:19,192 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 89. [2025-03-04 11:35:19,252 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:35:19,252 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:35:19,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:35:19,253 INFO L158 Benchmark]: Toolchain (without parser) took 29894.63ms. Allocated memory was 167.8MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 128.3MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-03-04 11:35:19,253 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 192.9MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:19,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.48ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 114.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:35:19,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.79ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 112.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:19,253 INFO L158 Benchmark]: Boogie Preprocessor took 33.45ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:19,253 INFO L158 Benchmark]: IcfgBuilder took 401.46ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 87.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:35:19,254 INFO L158 Benchmark]: TraceAbstraction took 29051.24ms. Allocated memory was 167.8MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 86.6MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-03-04 11:35:19,254 INFO L158 Benchmark]: Witness Printer took 137.16ms. Allocated memory is still 4.2GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:35:19,255 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.21ms. Allocated memory is still 192.9MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.48ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 114.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.79ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 112.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.45ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 401.46ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 87.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29051.24ms. Allocated memory was 167.8MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 86.6MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 137.16ms. Allocated memory is still 4.2GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. 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: 125]: 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] [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] 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] [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] 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] [L558] 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] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] 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] [L248] COND TRUE t1_i == 1 [L249] 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] [L253] COND TRUE t2_i == 1 [L254] 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] [L559] RET init_threads() [L560] 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] [L356] 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] [L361] 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] [L366] 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] [L371] 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] [L376] 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] [L381] 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] [L560] 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] [L561] 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] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] 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] [L178] 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] [L188] __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] [L190] 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] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] 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] [L443] CALL, EXPR is_transmit1_triggered() [L194] 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] [L197] 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] [L207] __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] [L209] 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] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] 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] [L451] CALL, EXPR is_transmit2_triggered() [L213] 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] [L216] 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] [L226] __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] [L228] 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] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] 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] [L561] 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] [L562] 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] [L394] 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] [L399] 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] [L404] 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] [L409] 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] [L414] 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] [L419] 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] [L562] 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] [L565] COND TRUE 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] [L568] kernel_st = 1 [L569] CALL eval() [L289] 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] [L293] COND TRUE 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] [L296] 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] [L263] 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] [L266] COND TRUE m_st == 0 [L267] __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] [L284] 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] [L296] 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] [L296] tmp = exists_runnable_thread() [L298] 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] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] 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] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] 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] [L117] COND TRUE 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=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L119] t1_pc = 1 [L120] 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] [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] 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] [L293] COND TRUE 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=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] 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] [L263] 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] [L266] COND TRUE m_st == 0 [L267] __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] [L284] 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] [L296] 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] [L296] tmp = exists_runnable_thread() [L298] 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] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [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, tmp_var=0, token=0] [L61] COND TRUE 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=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=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, tmp_var=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] [L467] 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] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] 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] [L178] 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] [L188] __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] [L190] 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] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] 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] [L443] CALL, EXPR is_transmit1_triggered() [L194] 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] [L197] 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] [L198] COND TRUE E_1 == 1 [L199] __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] [L209] 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] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] 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] [L451] CALL, EXPR is_transmit2_triggered() [L213] 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] [L216] 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] [L226] __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] [L228] 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] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] 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] [L467] 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, tmp_var=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, tmp_var=0, token=2147483647] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] 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] [L109] 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] [L125] 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: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: 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 8 procedures, 156 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 28.9s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9298 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9123 mSDsluCounter, 18649 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12424 mSDsCounter, 1018 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6021 IncrementalHoareTripleChecker+Invalid, 7039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1018 mSolverCounterUnsat, 6225 mSDtfsCounter, 6021 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.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22284occurred 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.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 11755 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2452 NumberOfCodeBlocks, 2452 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2301 ConstructedInterpolants, 0 QuantifiedInterpolants, 3900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 299/299 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-04 11:35:19,270 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)