./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:53:48,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:53:48,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:53:49,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:53:49,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:53:49,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:53:49,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:53:49,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:53:49,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:53:49,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:53:49,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:53:49,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:53:49,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:53:49,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:53:49,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:53:49,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:53:49,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:53:49,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:53:49,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:53:49,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:53:49,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:53:49,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:53:49,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:53:49,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:53:49,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:53:49,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:53:49,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:53:49,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:53:49,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:53:49,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:53:49,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:53:49,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:53:49,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:53:49,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:53:49,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:53:49,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:53:49,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:53:49,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:53:49,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:53:49,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:53:49,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:53:49,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:53:49,116 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:53:49,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:53:49,117 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:53:49,117 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:53:49,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:53:49,118 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:53:49,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:53:49,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:53:49,119 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:53:49,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:53:49,120 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:53:49,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:53:49,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:53:49,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:53:49,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:53:49,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:53:49,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:53:49,122 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:53:49,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:53:49,122 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:53:49,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:53:49,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:53:49,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:53:49,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:53:49,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:49,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:53:49,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:53:49,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:53:49,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:53:49,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:53:49,125 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:53:49,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:53:49,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:53:49,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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.graphml 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 ! call(reach_error())) ) 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 -> 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd [2022-02-20 18:53:49,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:53:49,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:53:49,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:53:49,395 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:53:49,396 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:53:49,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:53:49,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b879358/59c613e765d5470cb84557ff98d50aa1/FLAG7f0054d37 [2022-02-20 18:53:49,991 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:53:49,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:53:50,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b879358/59c613e765d5470cb84557ff98d50aa1/FLAG7f0054d37 [2022-02-20 18:53:50,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b879358/59c613e765d5470cb84557ff98d50aa1 [2022-02-20 18:53:50,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:53:50,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:53:50,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:50,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:53:50,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:53:50,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:50,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a58707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50, skipping insertion in model container [2022-02-20 18:53:50,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:50,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:53:50,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:53:50,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2022-02-20 18:53:50,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2022-02-20 18:53:50,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2022-02-20 18:53:50,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2022-02-20 18:53:50,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2022-02-20 18:53:50,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2022-02-20 18:53:50,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2022-02-20 18:53:50,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2022-02-20 18:53:50,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2022-02-20 18:53:50,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2022-02-20 18:53:50,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2022-02-20 18:53:50,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2022-02-20 18:53:50,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2022-02-20 18:53:50,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2022-02-20 18:53:50,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2022-02-20 18:53:50,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2022-02-20 18:53:50,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:50,901 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:53:50,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2022-02-20 18:53:50,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2022-02-20 18:53:51,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2022-02-20 18:53:51,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2022-02-20 18:53:51,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2022-02-20 18:53:51,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2022-02-20 18:53:51,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2022-02-20 18:53:51,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2022-02-20 18:53:51,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2022-02-20 18:53:51,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2022-02-20 18:53:51,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2022-02-20 18:53:51,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2022-02-20 18:53:51,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2022-02-20 18:53:51,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2022-02-20 18:53:51,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2022-02-20 18:53:51,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2022-02-20 18:53:51,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:51,188 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:53:51,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51 WrapperNode [2022-02-20 18:53:51,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:51,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:51,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:53:51,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:53:51,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,335 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3340 [2022-02-20 18:53:51,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:51,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:53:51,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:53:51,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:53:51,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:53:51,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:53:51,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:53:51,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:53:51,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (1/1) ... [2022-02-20 18:53:51,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:53:51,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:53:51,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:53:51,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:53:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:53:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:53:51,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:53:51,713 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:53:51,715 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:53:53,597 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:53:53,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:53:53,615 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:53:53,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:53 BoogieIcfgContainer [2022-02-20 18:53:53,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:53:53,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:53:53,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:53:53,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:53:53,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:53:50" (1/3) ... [2022-02-20 18:53:53,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d01b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:53, skipping insertion in model container [2022-02-20 18:53:53,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:51" (2/3) ... [2022-02-20 18:53:53,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d01b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:53, skipping insertion in model container [2022-02-20 18:53:53,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:53" (3/3) ... [2022-02-20 18:53:53,625 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:53:53,629 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:53:53,630 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-02-20 18:53:53,680 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:53:53,688 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:53:53,688 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-02-20 18:53:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:53:53,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:53,765 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2022-02-20 18:53:53,765 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:53:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash -50607350, now seen corresponding path program 1 times [2022-02-20 18:53:53,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:53,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114821117] [2022-02-20 18:53:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:54,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {629#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {631#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:54,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {631#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:54,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {631#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {631#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:54,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {631#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {632#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:53:54,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {632#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {632#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:53:54,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {632#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {633#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:54,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {633#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {630#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~2#1; {630#false} is VALID [2022-02-20 18:53:54,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {630#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~2#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~2#1 % 256 else main_~node2____CPAchecker_TMP_0~2#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {630#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {630#false} is VALID [2022-02-20 18:53:54,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {630#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~4#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~4#1 % 256 else main_~node3____CPAchecker_TMP_0~4#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~16#1;main_~node4__m4~16#1 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {630#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~8#1; {630#false} is VALID [2022-02-20 18:53:54,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {630#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~8#1 := ~p4_new~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~8#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~8#1 % 256 else main_~node4____CPAchecker_TMP_0~8#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~32#1;main_~node5__m5~32#1 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {630#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~16#1; {630#false} is VALID [2022-02-20 18:53:54,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {630#false} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~16#1 := ~p5_new~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~16#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~16#1 % 256 else main_~node5____CPAchecker_TMP_0~16#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~58#1; {630#false} is VALID [2022-02-20 18:53:54,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {630#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {630#false} is VALID [2022-02-20 18:53:54,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {630#false} assume !(~r1~0 % 256 >= 5); {630#false} is VALID [2022-02-20 18:53:54,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {630#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {630#false} is VALID [2022-02-20 18:53:54,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {630#false} assume ~r1~0 % 256 < 5;main_~check__tmp~58#1 := 1;~__return_6256~0 := main_~check__tmp~58#1;main_~main__c1~0#1 := ~__return_6256~0;havoc main_~__tmp_49~0#1;main_~__tmp_49~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~48#1;main_~assert__arg~48#1 := main_~__tmp_49~0#1; {630#false} is VALID [2022-02-20 18:53:54,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {630#false} assume !(0 == main_~assert__arg~48#1 % 256); {630#false} is VALID [2022-02-20 18:53:54,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {630#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {630#false} assume !(0 == ~mode1~0 % 256); {630#false} is VALID [2022-02-20 18:53:54,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {630#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {630#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {630#false} is VALID [2022-02-20 18:53:54,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {630#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {630#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {630#false} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {630#false} is VALID [2022-02-20 18:53:54,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {630#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {630#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {630#false} assume main_~node3__m3~1#1 != ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,248 INFO L290 TraceCheckUtils]: 59: Hoare triple {630#false} assume !(main_~node3__m3~1#1 > ~id3~0); {630#false} is VALID [2022-02-20 18:53:54,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {630#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {630#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {630#false} assume !(main_~node4__m4~3#1 != ~nomsg~0);~mode4~0 := 0; {630#false} is VALID [2022-02-20 18:53:54,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {630#false} havoc main_~node5__m5~4#1;main_~node5__m5~4#1 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,249 INFO L290 TraceCheckUtils]: 64: Hoare triple {630#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~4#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,249 INFO L290 TraceCheckUtils]: 65: Hoare triple {630#false} assume main_~node5__m5~4#1 != ~nomsg~0; {630#false} is VALID [2022-02-20 18:53:54,249 INFO L290 TraceCheckUtils]: 66: Hoare triple {630#false} assume !(main_~node5__m5~4#1 > ~id5~0); {630#false} is VALID [2022-02-20 18:53:54,250 INFO L290 TraceCheckUtils]: 67: Hoare triple {630#false} assume main_~node5__m5~4#1 == ~id5~0;~st5~0 := 1;~mode5~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {630#false} is VALID [2022-02-20 18:53:54,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {630#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7517~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7517~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {630#false} is VALID [2022-02-20 18:53:54,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {630#false} assume 0 == main_~assert__arg~7#1 % 256; {630#false} is VALID [2022-02-20 18:53:54,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {630#false} assume !false; {630#false} is VALID [2022-02-20 18:53:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:54,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:54,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114821117] [2022-02-20 18:53:54,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114821117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:54,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:54,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:53:54,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538418915] [2022-02-20 18:53:54,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-02-20 18:53:54,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:54,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:54,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:54,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:53:54,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:54,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:53:54,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:53:54,383 INFO L87 Difference]: Start difference. First operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:56,092 INFO L93 Difference]: Finished difference Result 971 states and 1686 transitions. [2022-02-20 18:53:56,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:53:56,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-02-20 18:53:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1686 transitions. [2022-02-20 18:53:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1686 transitions. [2022-02-20 18:53:56,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1686 transitions. [2022-02-20 18:53:57,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1686 edges. 1686 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:57,559 INFO L225 Difference]: With dead ends: 971 [2022-02-20 18:53:57,559 INFO L226 Difference]: Without dead ends: 498 [2022-02-20 18:53:57,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:57,566 INFO L933 BasicCegarLoop]: 589 mSDtfsCounter, 2522 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:57,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2522 Valid, 603 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:53:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-02-20 18:53:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2022-02-20 18:53:57,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:57,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand has 498 states, 482 states have (on average 1.3112033195020747) internal successors, (632), 497 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:57,750 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand has 498 states, 482 states have (on average 1.3112033195020747) internal successors, (632), 497 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:57,751 INFO L87 Difference]: Start difference. First operand 498 states. Second operand has 498 states, 482 states have (on average 1.3112033195020747) internal successors, (632), 497 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:57,771 INFO L93 Difference]: Finished difference Result 498 states and 632 transitions. [2022-02-20 18:53:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 632 transitions. [2022-02-20 18:53:57,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:57,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:57,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 498 states, 482 states have (on average 1.3112033195020747) internal successors, (632), 497 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 498 states. [2022-02-20 18:53:57,774 INFO L87 Difference]: Start difference. First operand has 498 states, 482 states have (on average 1.3112033195020747) internal successors, (632), 497 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 498 states. [2022-02-20 18:53:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:57,796 INFO L93 Difference]: Finished difference Result 498 states and 632 transitions. [2022-02-20 18:53:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 632 transitions. [2022-02-20 18:53:57,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:57,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:57,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:57,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 482 states have (on average 1.3112033195020747) internal successors, (632), 497 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 632 transitions. [2022-02-20 18:53:57,832 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 632 transitions. Word has length 71 [2022-02-20 18:53:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:57,833 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 632 transitions. [2022-02-20 18:53:57,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 632 transitions. [2022-02-20 18:53:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:53:57,837 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:57,837 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1] [2022-02-20 18:53:57,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:53:57,837 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:53:57,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash -329897172, now seen corresponding path program 1 times [2022-02-20 18:53:57,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:57,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258617223] [2022-02-20 18:53:57,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:57,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:58,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {3373#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {3375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:58,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {3375#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {3376#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:53:58,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {3376#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {3376#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:53:58,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {3376#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~send1~0 != ~nomsg~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~2#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~12#1;main_~node4__m4~12#1 := ~nomsg~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~4#1 := ~p4_new~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~4#1 % 256 else main_~node4____CPAchecker_TMP_0~4#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~24#1;main_~node5__m5~24#1 := ~nomsg~0; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~8#1; {3377#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:58,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {3377#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~8#1 := ~p5_new~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~8#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~8#1 % 256 else main_~node5____CPAchecker_TMP_0~8#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~42#1; {3374#false} is VALID [2022-02-20 18:53:58,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {3374#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3374#false} is VALID [2022-02-20 18:53:58,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {3374#false} assume !(~r1~0 % 256 >= 5); {3374#false} is VALID [2022-02-20 18:53:58,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {3374#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {3374#false} is VALID [2022-02-20 18:53:58,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {3374#false} assume ~r1~0 % 256 < 5;main_~check__tmp~42#1 := 1;~__return_8008~0 := main_~check__tmp~42#1;main_~main__c1~0#1 := ~__return_8008~0;havoc main_~__tmp_33~0#1;main_~__tmp_33~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~32#1;main_~assert__arg~32#1 := main_~__tmp_33~0#1; {3374#false} is VALID [2022-02-20 18:53:58,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {3374#false} assume !(0 == main_~assert__arg~32#1 % 256); {3374#false} is VALID [2022-02-20 18:53:58,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {3374#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {3374#false} assume !(0 == ~mode1~0 % 256); {3374#false} is VALID [2022-02-20 18:53:58,063 INFO L290 TraceCheckUtils]: 52: Hoare triple {3374#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {3374#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {3374#false} is VALID [2022-02-20 18:53:58,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {3374#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {3374#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {3374#false} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {3374#false} is VALID [2022-02-20 18:53:58,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {3374#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {3374#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {3374#false} assume main_~node3__m3~1#1 != ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {3374#false} assume !(main_~node3__m3~1#1 > ~id3~0); {3374#false} is VALID [2022-02-20 18:53:58,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {3374#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {3374#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {3374#false} assume !(main_~node4__m4~3#1 != ~nomsg~0);~mode4~0 := 0; {3374#false} is VALID [2022-02-20 18:53:58,065 INFO L290 TraceCheckUtils]: 64: Hoare triple {3374#false} havoc main_~node5__m5~4#1;main_~node5__m5~4#1 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {3374#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~4#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {3374#false} assume main_~node5__m5~4#1 != ~nomsg~0; {3374#false} is VALID [2022-02-20 18:53:58,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {3374#false} assume !(main_~node5__m5~4#1 > ~id5~0); {3374#false} is VALID [2022-02-20 18:53:58,067 INFO L290 TraceCheckUtils]: 68: Hoare triple {3374#false} assume main_~node5__m5~4#1 == ~id5~0;~st5~0 := 1;~mode5~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {3374#false} is VALID [2022-02-20 18:53:58,067 INFO L290 TraceCheckUtils]: 69: Hoare triple {3374#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7517~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7517~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {3374#false} is VALID [2022-02-20 18:53:58,067 INFO L290 TraceCheckUtils]: 70: Hoare triple {3374#false} assume 0 == main_~assert__arg~7#1 % 256; {3374#false} is VALID [2022-02-20 18:53:58,068 INFO L290 TraceCheckUtils]: 71: Hoare triple {3374#false} assume !false; {3374#false} is VALID [2022-02-20 18:53:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:58,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:58,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258617223] [2022-02-20 18:53:58,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258617223] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:58,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:58,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:53:58,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770502915] [2022-02-20 18:53:58,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:58,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:53:58,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:58,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:58,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:58,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:53:58,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:58,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:53:58,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:53:58,144 INFO L87 Difference]: Start difference. First operand 498 states and 632 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:59,468 INFO L93 Difference]: Finished difference Result 834 states and 1087 transitions. [2022-02-20 18:53:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:53:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:53:59,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1087 transitions. [2022-02-20 18:53:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1087 transitions. [2022-02-20 18:53:59,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1087 transitions. [2022-02-20 18:54:00,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1087 edges. 1087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:00,249 INFO L225 Difference]: With dead ends: 834 [2022-02-20 18:54:00,249 INFO L226 Difference]: Without dead ends: 458 [2022-02-20 18:54:00,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:00,251 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 1614 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:00,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1614 Valid, 328 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:54:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-02-20 18:54:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2022-02-20 18:54:00,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:00,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand has 458 states, 442 states have (on average 1.3190045248868778) internal successors, (583), 457 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,522 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand has 458 states, 442 states have (on average 1.3190045248868778) internal successors, (583), 457 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,523 INFO L87 Difference]: Start difference. First operand 458 states. Second operand has 458 states, 442 states have (on average 1.3190045248868778) internal successors, (583), 457 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:00,535 INFO L93 Difference]: Finished difference Result 458 states and 583 transitions. [2022-02-20 18:54:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 583 transitions. [2022-02-20 18:54:00,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:00,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:00,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 458 states, 442 states have (on average 1.3190045248868778) internal successors, (583), 457 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 458 states. [2022-02-20 18:54:00,539 INFO L87 Difference]: Start difference. First operand has 458 states, 442 states have (on average 1.3190045248868778) internal successors, (583), 457 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 458 states. [2022-02-20 18:54:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:00,552 INFO L93 Difference]: Finished difference Result 458 states and 583 transitions. [2022-02-20 18:54:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 583 transitions. [2022-02-20 18:54:00,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:00,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:00,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:00,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 442 states have (on average 1.3190045248868778) internal successors, (583), 457 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 583 transitions. [2022-02-20 18:54:00,569 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 583 transitions. Word has length 72 [2022-02-20 18:54:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:00,569 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 583 transitions. [2022-02-20 18:54:00,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 583 transitions. [2022-02-20 18:54:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:54:00,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:00,571 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-02-20 18:54:00,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:54:00,572 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:54:00,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:00,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1203518485, now seen corresponding path program 1 times [2022-02-20 18:54:00,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:00,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081772045] [2022-02-20 18:54:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:00,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:00,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {5856#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {5858#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:00,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {5858#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {5859#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:54:00,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {5859#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {5859#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:54:00,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {5859#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id5~0 >= 0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~st5~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send5~0 == ~id5~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode5~0 % 256; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id5~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id5~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id5~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~2#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~12#1;main_~node4__m4~12#1 := ~nomsg~0; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {5860#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:00,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {5860#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~4#1 := ~p4_new~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~4#1 % 256 else main_~node4____CPAchecker_TMP_0~4#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~24#1;main_~node5__m5~24#1 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {5857#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~8#1; {5857#false} is VALID [2022-02-20 18:54:00,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {5857#false} assume ~send5~0 != ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {5857#false} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~8#1 := ~send5~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~8#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~8#1 % 256 else main_~node5____CPAchecker_TMP_0~8#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~41#1; {5857#false} is VALID [2022-02-20 18:54:00,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {5857#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {5857#false} is VALID [2022-02-20 18:54:00,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {5857#false} assume !(~r1~0 % 256 >= 5); {5857#false} is VALID [2022-02-20 18:54:00,705 INFO L290 TraceCheckUtils]: 48: Hoare triple {5857#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {5857#false} is VALID [2022-02-20 18:54:00,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {5857#false} assume ~r1~0 % 256 < 5;main_~check__tmp~41#1 := 1;~__return_8121~0 := main_~check__tmp~41#1;main_~main__c1~0#1 := ~__return_8121~0;havoc main_~__tmp_32~0#1;main_~__tmp_32~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~31#1;main_~assert__arg~31#1 := main_~__tmp_32~0#1; {5857#false} is VALID [2022-02-20 18:54:00,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {5857#false} assume !(0 == main_~assert__arg~31#1 % 256); {5857#false} is VALID [2022-02-20 18:54:00,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {5857#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {5857#false} assume !(0 == ~mode1~0 % 256); {5857#false} is VALID [2022-02-20 18:54:00,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {5857#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,706 INFO L290 TraceCheckUtils]: 54: Hoare triple {5857#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {5857#false} is VALID [2022-02-20 18:54:00,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {5857#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {5857#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {5857#false} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {5857#false} is VALID [2022-02-20 18:54:00,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {5857#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,707 INFO L290 TraceCheckUtils]: 59: Hoare triple {5857#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,708 INFO L290 TraceCheckUtils]: 60: Hoare triple {5857#false} assume main_~node3__m3~1#1 != ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {5857#false} assume !(main_~node3__m3~1#1 > ~id3~0); {5857#false} is VALID [2022-02-20 18:54:00,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {5857#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,708 INFO L290 TraceCheckUtils]: 63: Hoare triple {5857#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,708 INFO L290 TraceCheckUtils]: 64: Hoare triple {5857#false} assume !(main_~node4__m4~3#1 != ~nomsg~0);~mode4~0 := 0; {5857#false} is VALID [2022-02-20 18:54:00,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {5857#false} havoc main_~node5__m5~4#1;main_~node5__m5~4#1 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,709 INFO L290 TraceCheckUtils]: 66: Hoare triple {5857#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~4#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,709 INFO L290 TraceCheckUtils]: 67: Hoare triple {5857#false} assume main_~node5__m5~4#1 != ~nomsg~0; {5857#false} is VALID [2022-02-20 18:54:00,709 INFO L290 TraceCheckUtils]: 68: Hoare triple {5857#false} assume !(main_~node5__m5~4#1 > ~id5~0); {5857#false} is VALID [2022-02-20 18:54:00,709 INFO L290 TraceCheckUtils]: 69: Hoare triple {5857#false} assume main_~node5__m5~4#1 == ~id5~0;~st5~0 := 1;~mode5~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {5857#false} is VALID [2022-02-20 18:54:00,709 INFO L290 TraceCheckUtils]: 70: Hoare triple {5857#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7517~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7517~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {5857#false} is VALID [2022-02-20 18:54:00,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {5857#false} assume 0 == main_~assert__arg~7#1 % 256; {5857#false} is VALID [2022-02-20 18:54:00,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {5857#false} assume !false; {5857#false} is VALID [2022-02-20 18:54:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:00,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:00,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081772045] [2022-02-20 18:54:00,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081772045] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:00,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:00,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:00,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041763349] [2022-02-20 18:54:00,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-02-20 18:54:00,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:00,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:00,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:00,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:00,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:00,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:00,773 INFO L87 Difference]: Start difference. First operand 458 states and 583 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:02,026 INFO L93 Difference]: Finished difference Result 794 states and 1037 transitions. [2022-02-20 18:54:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:02,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-02-20 18:54:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1037 transitions. [2022-02-20 18:54:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1037 transitions. [2022-02-20 18:54:02,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1037 transitions. [2022-02-20 18:54:02,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1037 edges. 1037 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:02,761 INFO L225 Difference]: With dead ends: 794 [2022-02-20 18:54:02,761 INFO L226 Difference]: Without dead ends: 426 [2022-02-20 18:54:02,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:02,763 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 1537 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:02,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 322 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:54:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-02-20 18:54:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-02-20 18:54:03,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:03,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand has 426 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 425 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,064 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand has 426 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 425 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,065 INFO L87 Difference]: Start difference. First operand 426 states. Second operand has 426 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 425 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:03,076 INFO L93 Difference]: Finished difference Result 426 states and 546 transitions. [2022-02-20 18:54:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 546 transitions. [2022-02-20 18:54:03,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:03,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:03,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 425 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 426 states. [2022-02-20 18:54:03,079 INFO L87 Difference]: Start difference. First operand has 426 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 425 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 426 states. [2022-02-20 18:54:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:03,090 INFO L93 Difference]: Finished difference Result 426 states and 546 transitions. [2022-02-20 18:54:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 546 transitions. [2022-02-20 18:54:03,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:03,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:03,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:03,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 425 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 546 transitions. [2022-02-20 18:54:03,104 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 546 transitions. Word has length 73 [2022-02-20 18:54:03,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:03,105 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 546 transitions. [2022-02-20 18:54:03,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,105 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 546 transitions. [2022-02-20 18:54:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:54:03,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:03,106 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:03,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:54:03,107 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:54:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2052061875, now seen corresponding path program 1 times [2022-02-20 18:54:03,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:03,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353826531] [2022-02-20 18:54:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:03,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {8203#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {8205#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:03,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {8205#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {8205#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:03,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {8205#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {8205#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:03,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {8205#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {8205#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:03,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {8205#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {8205#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:03,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {8205#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {8205#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:03,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {8205#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {8205#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:03,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {8205#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {8206#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:54:03,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {8206#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {8206#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:54:03,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {8206#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id5~0 >= 0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st5~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send5~0 == ~id5~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode5~0 % 256; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id5~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id5~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id5~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8207#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:03,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {8207#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {8204#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {8204#false} is VALID [2022-02-20 18:54:03,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {8204#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~2#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~12#1;main_~node4__m4~12#1 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {8204#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {8204#false} is VALID [2022-02-20 18:54:03,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {8204#false} assume ~send4~0 != ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {8204#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~4#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~4#1 % 256 else main_~node4____CPAchecker_TMP_0~4#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~23#1;main_~node5__m5~23#1 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {8204#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~7#1; {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {8204#false} assume ~send5~0 != ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {8204#false} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~7#1 := ~send5~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~7#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~7#1 % 256 else main_~node5____CPAchecker_TMP_0~7#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~39#1; {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {8204#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 48: Hoare triple {8204#false} assume !(~r1~0 % 256 >= 5); {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {8204#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {8204#false} assume ~r1~0 % 256 < 5;main_~check__tmp~39#1 := 1;~__return_8319~0 := main_~check__tmp~39#1;main_~main__c1~0#1 := ~__return_8319~0;havoc main_~__tmp_30~0#1;main_~__tmp_30~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~29#1;main_~assert__arg~29#1 := main_~__tmp_30~0#1; {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {8204#false} assume !(0 == main_~assert__arg~29#1 % 256); {8204#false} is VALID [2022-02-20 18:54:03,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {8204#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {8204#false} assume !(0 == ~mode1~0 % 256); {8204#false} is VALID [2022-02-20 18:54:03,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {8204#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {8204#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {8204#false} is VALID [2022-02-20 18:54:03,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {8204#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {8204#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {8204#false} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {8204#false} is VALID [2022-02-20 18:54:03,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {8204#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {8204#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {8204#false} assume main_~node3__m3~1#1 != ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {8204#false} assume !(main_~node3__m3~1#1 > ~id3~0); {8204#false} is VALID [2022-02-20 18:54:03,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {8204#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {8204#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {8204#false} assume !(main_~node4__m4~3#1 != ~nomsg~0);~mode4~0 := 0; {8204#false} is VALID [2022-02-20 18:54:03,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {8204#false} havoc main_~node5__m5~4#1;main_~node5__m5~4#1 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,241 INFO L290 TraceCheckUtils]: 67: Hoare triple {8204#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~4#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {8204#false} assume main_~node5__m5~4#1 != ~nomsg~0; {8204#false} is VALID [2022-02-20 18:54:03,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {8204#false} assume !(main_~node5__m5~4#1 > ~id5~0); {8204#false} is VALID [2022-02-20 18:54:03,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {8204#false} assume main_~node5__m5~4#1 == ~id5~0;~st5~0 := 1;~mode5~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {8204#false} is VALID [2022-02-20 18:54:03,242 INFO L290 TraceCheckUtils]: 71: Hoare triple {8204#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7517~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7517~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {8204#false} is VALID [2022-02-20 18:54:03,242 INFO L290 TraceCheckUtils]: 72: Hoare triple {8204#false} assume 0 == main_~assert__arg~7#1 % 256; {8204#false} is VALID [2022-02-20 18:54:03,242 INFO L290 TraceCheckUtils]: 73: Hoare triple {8204#false} assume !false; {8204#false} is VALID [2022-02-20 18:54:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:03,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:03,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353826531] [2022-02-20 18:54:03,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353826531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:03,243 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:03,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:03,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449749205] [2022-02-20 18:54:03,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:03,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:54:03,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:03,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:03,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:03,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:03,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:03,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:03,291 INFO L87 Difference]: Start difference. First operand 426 states and 546 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:04,478 INFO L93 Difference]: Finished difference Result 762 states and 999 transitions. [2022-02-20 18:54:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:04,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 18:54:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 999 transitions. [2022-02-20 18:54:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 999 transitions. [2022-02-20 18:54:04,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 999 transitions. [2022-02-20 18:54:05,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 999 edges. 999 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:05,299 INFO L225 Difference]: With dead ends: 762 [2022-02-20 18:54:05,300 INFO L226 Difference]: Without dead ends: 401 [2022-02-20 18:54:05,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:05,303 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 1491 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:05,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1491 Valid, 309 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-02-20 18:54:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2022-02-20 18:54:05,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:05,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states. Second operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,716 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,717 INFO L87 Difference]: Start difference. First operand 401 states. Second operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:05,726 INFO L93 Difference]: Finished difference Result 401 states and 518 transitions. [2022-02-20 18:54:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 518 transitions. [2022-02-20 18:54:05,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:05,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:05,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 401 states. [2022-02-20 18:54:05,729 INFO L87 Difference]: Start difference. First operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 401 states. [2022-02-20 18:54:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:05,739 INFO L93 Difference]: Finished difference Result 401 states and 518 transitions. [2022-02-20 18:54:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 518 transitions. [2022-02-20 18:54:05,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:05,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:05,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:05,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 518 transitions. [2022-02-20 18:54:05,751 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 518 transitions. Word has length 74 [2022-02-20 18:54:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:05,752 INFO L470 AbstractCegarLoop]: Abstraction has 401 states and 518 transitions. [2022-02-20 18:54:05,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 518 transitions. [2022-02-20 18:54:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:54:05,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:05,753 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:05,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:54:05,754 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:54:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1326375668, now seen corresponding path program 1 times [2022-02-20 18:54:05,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:05,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120452875] [2022-02-20 18:54:05,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:05,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {10443#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {10445#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:05,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {10445#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {10446#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:54:05,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {10446#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {10446#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:54:05,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {10446#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id5~0 >= 0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st5~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send5~0 == ~id5~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode5~0 % 256; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id5~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id5~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id5~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10447#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:54:05,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {10447#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~10#1;main_~node4__m4~10#1 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {10444#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~2#1; {10444#false} is VALID [2022-02-20 18:54:05,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {10444#false} assume ~send4~0 != ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {10444#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~2#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~2#1 % 256 else main_~node4____CPAchecker_TMP_0~2#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~19#1;main_~node5__m5~19#1 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {10444#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~3#1; {10444#false} is VALID [2022-02-20 18:54:05,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {10444#false} assume ~send5~0 != ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {10444#false} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~3#1 := ~send5~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~3#1 % 256 else main_~node5____CPAchecker_TMP_0~3#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~31#1; {10444#false} is VALID [2022-02-20 18:54:05,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {10444#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {10444#false} is VALID [2022-02-20 18:54:05,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {10444#false} assume !(~r1~0 % 256 >= 5); {10444#false} is VALID [2022-02-20 18:54:05,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {10444#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {10444#false} is VALID [2022-02-20 18:54:05,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {10444#false} assume ~r1~0 % 256 < 5;main_~check__tmp~31#1 := 1;~__return_9037~0 := main_~check__tmp~31#1;main_~main__c1~0#1 := ~__return_9037~0;havoc main_~__tmp_22~0#1;main_~__tmp_22~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~21#1;main_~assert__arg~21#1 := main_~__tmp_22~0#1; {10444#false} is VALID [2022-02-20 18:54:05,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {10444#false} assume !(0 == main_~assert__arg~21#1 % 256); {10444#false} is VALID [2022-02-20 18:54:05,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {10444#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {10444#false} assume !(0 == ~mode1~0 % 256); {10444#false} is VALID [2022-02-20 18:54:05,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {10444#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {10444#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {10444#false} is VALID [2022-02-20 18:54:05,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {10444#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,875 INFO L290 TraceCheckUtils]: 58: Hoare triple {10444#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {10444#false} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {10444#false} is VALID [2022-02-20 18:54:05,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {10444#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {10444#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,876 INFO L290 TraceCheckUtils]: 62: Hoare triple {10444#false} assume main_~node3__m3~1#1 != ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,876 INFO L290 TraceCheckUtils]: 63: Hoare triple {10444#false} assume !(main_~node3__m3~1#1 > ~id3~0); {10444#false} is VALID [2022-02-20 18:54:05,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {10444#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {10444#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,877 INFO L290 TraceCheckUtils]: 66: Hoare triple {10444#false} assume !(main_~node4__m4~3#1 != ~nomsg~0);~mode4~0 := 0; {10444#false} is VALID [2022-02-20 18:54:05,877 INFO L290 TraceCheckUtils]: 67: Hoare triple {10444#false} havoc main_~node5__m5~4#1;main_~node5__m5~4#1 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {10444#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~4#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {10444#false} assume main_~node5__m5~4#1 != ~nomsg~0; {10444#false} is VALID [2022-02-20 18:54:05,878 INFO L290 TraceCheckUtils]: 70: Hoare triple {10444#false} assume !(main_~node5__m5~4#1 > ~id5~0); {10444#false} is VALID [2022-02-20 18:54:05,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {10444#false} assume main_~node5__m5~4#1 == ~id5~0;~st5~0 := 1;~mode5~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {10444#false} is VALID [2022-02-20 18:54:05,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {10444#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7517~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7517~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {10444#false} is VALID [2022-02-20 18:54:05,878 INFO L290 TraceCheckUtils]: 73: Hoare triple {10444#false} assume 0 == main_~assert__arg~7#1 % 256; {10444#false} is VALID [2022-02-20 18:54:05,878 INFO L290 TraceCheckUtils]: 74: Hoare triple {10444#false} assume !false; {10444#false} is VALID [2022-02-20 18:54:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:05,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:05,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120452875] [2022-02-20 18:54:05,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120452875] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:05,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:05,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:05,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636502603] [2022-02-20 18:54:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:05,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:54:05,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:05,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:05,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:05,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:05,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:05,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:05,936 INFO L87 Difference]: Start difference. First operand 401 states and 518 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:07,189 INFO L93 Difference]: Finished difference Result 737 states and 970 transitions. [2022-02-20 18:54:07,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:07,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:54:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 970 transitions. [2022-02-20 18:54:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 970 transitions. [2022-02-20 18:54:07,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 970 transitions. [2022-02-20 18:54:07,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 970 edges. 970 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:07,873 INFO L225 Difference]: With dead ends: 737 [2022-02-20 18:54:07,873 INFO L226 Difference]: Without dead ends: 390 [2022-02-20 18:54:07,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:07,875 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 1435 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:07,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1435 Valid, 304 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:54:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-02-20 18:54:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2022-02-20 18:54:08,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:08,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,390 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,391 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:08,402 INFO L93 Difference]: Finished difference Result 390 states and 505 transitions. [2022-02-20 18:54:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 505 transitions. [2022-02-20 18:54:08,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:08,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:08,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 390 states. [2022-02-20 18:54:08,404 INFO L87 Difference]: Start difference. First operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 390 states. [2022-02-20 18:54:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:08,416 INFO L93 Difference]: Finished difference Result 390 states and 505 transitions. [2022-02-20 18:54:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 505 transitions. [2022-02-20 18:54:08,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:08,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:08,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:08,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 505 transitions. [2022-02-20 18:54:08,429 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 505 transitions. Word has length 75 [2022-02-20 18:54:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:08,430 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 505 transitions. [2022-02-20 18:54:08,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 505 transitions. [2022-02-20 18:54:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:54:08,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:08,431 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:08,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:54:08,431 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:54:08,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash -976633234, now seen corresponding path program 1 times [2022-02-20 18:54:08,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:08,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953829389] [2022-02-20 18:54:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:08,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {12625#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {12627#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:54:08,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {12627#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {12628#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id5~0 >= 0; {12629#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= (+ ~nomsg~0 1) ~id5~0))} is VALID [2022-02-20 18:54:08,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {12629#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= (+ ~nomsg~0 1) ~id5~0))} assume 0 == ~st5~0; {12629#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= (+ ~nomsg~0 1) ~id5~0))} is VALID [2022-02-20 18:54:08,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {12629#(and (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= (+ ~nomsg~0 1) ~id5~0))} assume ~send5~0 == ~id5~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode5~0 % 256; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id5~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id5~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id5~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 != ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send5~0 != ~nomsg~0; {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:08,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {12630#(and (<= (+ ~nomsg~0 1) ~send5~0) (<= ~send5~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {12631#(not (= ~nomsg~0 ~p5_old~0))} is VALID [2022-02-20 18:54:08,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {12631#(not (= ~nomsg~0 ~p5_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {12631#(not (= ~nomsg~0 ~p5_old~0))} is VALID [2022-02-20 18:54:08,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {12631#(not (= ~nomsg~0 ~p5_old~0))} assume !(~r1~0 % 256 >= 5); {12631#(not (= ~nomsg~0 ~p5_old~0))} is VALID [2022-02-20 18:54:08,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {12631#(not (= ~nomsg~0 ~p5_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {12631#(not (= ~nomsg~0 ~p5_old~0))} is VALID [2022-02-20 18:54:08,683 INFO L290 TraceCheckUtils]: 52: Hoare triple {12631#(not (= ~nomsg~0 ~p5_old~0))} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_9351~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_9351~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {12631#(not (= ~nomsg~0 ~p5_old~0))} is VALID [2022-02-20 18:54:08,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {12631#(not (= ~nomsg~0 ~p5_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {12631#(not (= ~nomsg~0 ~p5_old~0))} is VALID [2022-02-20 18:54:08,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {12631#(not (= ~nomsg~0 ~p5_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12631#(not (= ~nomsg~0 ~p5_old~0))} is VALID [2022-02-20 18:54:08,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {12631#(not (= ~nomsg~0 ~p5_old~0))} assume !(0 == ~mode1~0 % 256); {12631#(not (= ~nomsg~0 ~p5_old~0))} is VALID [2022-02-20 18:54:08,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {12631#(not (= ~nomsg~0 ~p5_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12632#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:54:08,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {12632#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {12626#false} is VALID [2022-02-20 18:54:08,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {12626#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,685 INFO L290 TraceCheckUtils]: 59: Hoare triple {12626#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {12626#false} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {12626#false} is VALID [2022-02-20 18:54:08,685 INFO L290 TraceCheckUtils]: 61: Hoare triple {12626#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {12626#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {12626#false} assume main_~node3__m3~1#1 != ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {12626#false} assume !(main_~node3__m3~1#1 > ~id3~0); {12626#false} is VALID [2022-02-20 18:54:08,686 INFO L290 TraceCheckUtils]: 65: Hoare triple {12626#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,686 INFO L290 TraceCheckUtils]: 66: Hoare triple {12626#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,686 INFO L290 TraceCheckUtils]: 67: Hoare triple {12626#false} assume !(main_~node4__m4~3#1 != ~nomsg~0);~mode4~0 := 0; {12626#false} is VALID [2022-02-20 18:54:08,686 INFO L290 TraceCheckUtils]: 68: Hoare triple {12626#false} havoc main_~node5__m5~4#1;main_~node5__m5~4#1 := ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {12626#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~4#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {12626#false} assume main_~node5__m5~4#1 != ~nomsg~0; {12626#false} is VALID [2022-02-20 18:54:08,687 INFO L290 TraceCheckUtils]: 71: Hoare triple {12626#false} assume !(main_~node5__m5~4#1 > ~id5~0); {12626#false} is VALID [2022-02-20 18:54:08,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {12626#false} assume main_~node5__m5~4#1 == ~id5~0;~st5~0 := 1;~mode5~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {12626#false} is VALID [2022-02-20 18:54:08,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {12626#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7517~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7517~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {12626#false} is VALID [2022-02-20 18:54:08,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {12626#false} assume 0 == main_~assert__arg~7#1 % 256; {12626#false} is VALID [2022-02-20 18:54:08,688 INFO L290 TraceCheckUtils]: 75: Hoare triple {12626#false} assume !false; {12626#false} is VALID [2022-02-20 18:54:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:08,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:08,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953829389] [2022-02-20 18:54:08,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953829389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:08,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:08,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:54:08,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467730434] [2022-02-20 18:54:08,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 18:54:08,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:08,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:08,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:54:08,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:08,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:54:08,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:54:08,759 INFO L87 Difference]: Start difference. First operand 390 states and 505 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:11,969 INFO L93 Difference]: Finished difference Result 754 states and 962 transitions. [2022-02-20 18:54:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:54:11,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 18:54:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 962 transitions. [2022-02-20 18:54:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 962 transitions. [2022-02-20 18:54:11,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 962 transitions. [2022-02-20 18:54:12,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 962 edges. 962 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:12,758 INFO L225 Difference]: With dead ends: 754 [2022-02-20 18:54:12,758 INFO L226 Difference]: Without dead ends: 542 [2022-02-20 18:54:12,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:54:12,759 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 2634 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2634 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:12,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2634 Valid, 681 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:54:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-02-20 18:54:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 390. [2022-02-20 18:54:13,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:13,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:13,342 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:13,343 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:13,364 INFO L93 Difference]: Finished difference Result 542 states and 680 transitions. [2022-02-20 18:54:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 680 transitions. [2022-02-20 18:54:13,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:13,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:13,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 542 states. [2022-02-20 18:54:13,367 INFO L87 Difference]: Start difference. First operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 542 states. [2022-02-20 18:54:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:13,388 INFO L93 Difference]: Finished difference Result 542 states and 680 transitions. [2022-02-20 18:54:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 680 transitions. [2022-02-20 18:54:13,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:13,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:13,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:13,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 504 transitions. [2022-02-20 18:54:13,400 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 504 transitions. Word has length 76 [2022-02-20 18:54:13,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:13,401 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 504 transitions. [2022-02-20 18:54:13,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 504 transitions. [2022-02-20 18:54:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:54:13,405 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:13,405 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:13,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:54:13,405 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:54:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash 649885335, now seen corresponding path program 1 times [2022-02-20 18:54:13,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:13,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536619010] [2022-02-20 18:54:13,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:13,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:13,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {15165#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {15167#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:13,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {15167#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:54:13,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:54:13,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:54:13,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:54:13,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:54:13,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:54:13,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {15168#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {15169#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:54:13,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {15169#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {15169#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:54:13,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {15169#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id5~0 >= 0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st5~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send5~0 == ~id5~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode5~0 % 256; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id5~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id5~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id5~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:54:13,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {15170#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15171#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} is VALID [2022-02-20 18:54:13,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {15171#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15171#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} is VALID [2022-02-20 18:54:13,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {15171#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} assume ~send2~0 != ~nomsg~0; {15171#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} is VALID [2022-02-20 18:54:13,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {15171#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:13,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:13,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume ~send3~0 != ~nomsg~0; {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:13,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:13,676 INFO L290 TraceCheckUtils]: 43: Hoare triple {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:13,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume ~send4~0 != ~nomsg~0; {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:13,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:13,678 INFO L290 TraceCheckUtils]: 46: Hoare triple {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:13,678 INFO L290 TraceCheckUtils]: 47: Hoare triple {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume ~send5~0 != ~nomsg~0; {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:13,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {15172#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(~r1~0 % 256 >= 5); {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,681 INFO L290 TraceCheckUtils]: 51: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_9351~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_9351~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,682 INFO L290 TraceCheckUtils]: 53: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256); {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,682 INFO L290 TraceCheckUtils]: 54: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(0 == ~mode1~0 % 256); {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,685 INFO L290 TraceCheckUtils]: 59: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:13,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {15173#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15174#(or (not (= |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0)) (not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|)))} is VALID [2022-02-20 18:54:13,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {15174#(or (not (= |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0)) (not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|)))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {15175#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:13,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {15175#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {15175#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:13,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {15175#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15176#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:54:13,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {15176#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {15166#false} is VALID [2022-02-20 18:54:13,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {15166#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {15166#false} is VALID [2022-02-20 18:54:13,691 INFO L290 TraceCheckUtils]: 66: Hoare triple {15166#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15166#false} is VALID [2022-02-20 18:54:13,691 INFO L290 TraceCheckUtils]: 67: Hoare triple {15166#false} assume main_~node4__m4~6#1 != ~nomsg~0; {15166#false} is VALID [2022-02-20 18:54:13,691 INFO L290 TraceCheckUtils]: 68: Hoare triple {15166#false} assume !(main_~node4__m4~6#1 > ~id4~0); {15166#false} is VALID [2022-02-20 18:54:13,692 INFO L290 TraceCheckUtils]: 69: Hoare triple {15166#false} assume main_~node4__m4~6#1 == ~id4~0;~st4~0 := 1;~mode4~0 := 0;havoc main_~node5__m5~11#1;main_~node5__m5~11#1 := ~nomsg~0; {15166#false} is VALID [2022-02-20 18:54:13,692 INFO L290 TraceCheckUtils]: 70: Hoare triple {15166#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~11#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15166#false} is VALID [2022-02-20 18:54:13,692 INFO L290 TraceCheckUtils]: 71: Hoare triple {15166#false} assume !(main_~node5__m5~11#1 != ~nomsg~0);~mode5~0 := 0; {15166#false} is VALID [2022-02-20 18:54:13,692 INFO L290 TraceCheckUtils]: 72: Hoare triple {15166#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~19#1; {15166#false} is VALID [2022-02-20 18:54:13,692 INFO L290 TraceCheckUtils]: 73: Hoare triple {15166#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~19#1 := 0;~__return_7026~0 := main_~check__tmp~19#1;main_~main__c1~0#1 := ~__return_7026~0;havoc main_~__tmp_16~0#1;main_~__tmp_16~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~15#1;main_~assert__arg~15#1 := main_~__tmp_16~0#1; {15166#false} is VALID [2022-02-20 18:54:13,692 INFO L290 TraceCheckUtils]: 74: Hoare triple {15166#false} assume 0 == main_~assert__arg~15#1 % 256; {15166#false} is VALID [2022-02-20 18:54:13,693 INFO L290 TraceCheckUtils]: 75: Hoare triple {15166#false} assume !false; {15166#false} is VALID [2022-02-20 18:54:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:13,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:13,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536619010] [2022-02-20 18:54:13,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536619010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:13,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:13,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:54:13,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683967230] [2022-02-20 18:54:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:13,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 18:54:13,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:13,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:13,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:13,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:54:13,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:54:13,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:54:13,747 INFO L87 Difference]: Start difference. First operand 390 states and 504 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:19,208 INFO L93 Difference]: Finished difference Result 904 states and 1205 transitions. [2022-02-20 18:54:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 18:54:19,208 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 18:54:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1205 transitions. [2022-02-20 18:54:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1205 transitions. [2022-02-20 18:54:19,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 1205 transitions. [2022-02-20 18:54:20,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1205 edges. 1205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:20,194 INFO L225 Difference]: With dead ends: 904 [2022-02-20 18:54:20,194 INFO L226 Difference]: Without dead ends: 806 [2022-02-20 18:54:20,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:54:20,195 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 2761 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2761 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:20,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2761 Valid, 1860 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 18:54:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-02-20 18:54:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 393. [2022-02-20 18:54:20,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:20,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 806 states. Second operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:20,886 INFO L74 IsIncluded]: Start isIncluded. First operand 806 states. Second operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:20,887 INFO L87 Difference]: Start difference. First operand 806 states. Second operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:20,919 INFO L93 Difference]: Finished difference Result 806 states and 1067 transitions. [2022-02-20 18:54:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1067 transitions. [2022-02-20 18:54:20,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:20,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:20,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 806 states. [2022-02-20 18:54:20,922 INFO L87 Difference]: Start difference. First operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 806 states. [2022-02-20 18:54:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:20,948 INFO L93 Difference]: Finished difference Result 806 states and 1067 transitions. [2022-02-20 18:54:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1067 transitions. [2022-02-20 18:54:20,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:20,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:20,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:20,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 507 transitions. [2022-02-20 18:54:20,959 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 507 transitions. Word has length 76 [2022-02-20 18:54:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:20,960 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 507 transitions. [2022-02-20 18:54:20,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 507 transitions. [2022-02-20 18:54:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:54:20,961 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:20,961 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:20,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:54:20,962 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:54:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 241040107, now seen corresponding path program 1 times [2022-02-20 18:54:20,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:20,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849999017] [2022-02-20 18:54:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:21,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {18459#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {18461#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:54:21,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {18461#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {18462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {18462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {18462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {18462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {18463#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {18463#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {18463#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {18463#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id5~0 >= 0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st5~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send5~0 == ~id5~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode5~0 % 256; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id5~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id5~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id5~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:21,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {18464#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume ~send5~0 != ~nomsg~0; {18465#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:54:21,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {18465#(not (= ~nomsg~0 ~p1_new~0))} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 5); {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,179 INFO L290 TraceCheckUtils]: 51: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_9351~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_9351~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,180 INFO L290 TraceCheckUtils]: 53: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,180 INFO L290 TraceCheckUtils]: 54: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,181 INFO L290 TraceCheckUtils]: 57: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {18466#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:54:21,182 INFO L290 TraceCheckUtils]: 60: Hoare triple {18466#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18467#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} is VALID [2022-02-20 18:54:21,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {18467#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {18460#false} is VALID [2022-02-20 18:54:21,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {18460#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {18460#false} is VALID [2022-02-20 18:54:21,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {18460#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18460#false} is VALID [2022-02-20 18:54:21,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {18460#false} assume main_~node3__m3~4#1 != ~nomsg~0; {18460#false} is VALID [2022-02-20 18:54:21,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {18460#false} assume !(main_~node3__m3~4#1 > ~id3~0); {18460#false} is VALID [2022-02-20 18:54:21,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {18460#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {18460#false} is VALID [2022-02-20 18:54:21,184 INFO L290 TraceCheckUtils]: 67: Hoare triple {18460#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18460#false} is VALID [2022-02-20 18:54:21,184 INFO L290 TraceCheckUtils]: 68: Hoare triple {18460#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {18460#false} is VALID [2022-02-20 18:54:21,184 INFO L290 TraceCheckUtils]: 69: Hoare triple {18460#false} havoc main_~node5__m5~12#1;main_~node5__m5~12#1 := ~nomsg~0; {18460#false} is VALID [2022-02-20 18:54:21,184 INFO L290 TraceCheckUtils]: 70: Hoare triple {18460#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~12#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18460#false} is VALID [2022-02-20 18:54:21,184 INFO L290 TraceCheckUtils]: 71: Hoare triple {18460#false} assume !(main_~node5__m5~12#1 != ~nomsg~0);~mode5~0 := 0; {18460#false} is VALID [2022-02-20 18:54:21,184 INFO L290 TraceCheckUtils]: 72: Hoare triple {18460#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~21#1; {18460#false} is VALID [2022-02-20 18:54:21,185 INFO L290 TraceCheckUtils]: 73: Hoare triple {18460#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~21#1 := 0;~__return_7427~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_7427~0;havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~16#1;main_~assert__arg~16#1 := main_~__tmp_17~0#1; {18460#false} is VALID [2022-02-20 18:54:21,185 INFO L290 TraceCheckUtils]: 74: Hoare triple {18460#false} assume 0 == main_~assert__arg~16#1 % 256; {18460#false} is VALID [2022-02-20 18:54:21,185 INFO L290 TraceCheckUtils]: 75: Hoare triple {18460#false} assume !false; {18460#false} is VALID [2022-02-20 18:54:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:21,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:21,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849999017] [2022-02-20 18:54:21,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849999017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:21,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:21,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:54:21,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829302712] [2022-02-20 18:54:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:21,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 18:54:21,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:21,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:21,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:21,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:54:21,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:21,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:54:21,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:54:21,239 INFO L87 Difference]: Start difference. First operand 393 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:26,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:26,670 INFO L93 Difference]: Finished difference Result 863 states and 1158 transitions. [2022-02-20 18:54:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:54:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 18:54:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1158 transitions. [2022-02-20 18:54:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1158 transitions. [2022-02-20 18:54:26,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 1158 transitions. [2022-02-20 18:54:27,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1158 edges. 1158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:27,531 INFO L225 Difference]: With dead ends: 863 [2022-02-20 18:54:27,531 INFO L226 Difference]: Without dead ends: 735 [2022-02-20 18:54:27,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:54:27,532 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 2737 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:27,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2737 Valid, 2176 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 18:54:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-02-20 18:54:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 390. [2022-02-20 18:54:28,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:28,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 735 states. Second operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:28,279 INFO L74 IsIncluded]: Start isIncluded. First operand 735 states. Second operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:28,279 INFO L87 Difference]: Start difference. First operand 735 states. Second operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:28,300 INFO L93 Difference]: Finished difference Result 735 states and 979 transitions. [2022-02-20 18:54:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 979 transitions. [2022-02-20 18:54:28,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:28,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:28,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 735 states. [2022-02-20 18:54:28,302 INFO L87 Difference]: Start difference. First operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 735 states. [2022-02-20 18:54:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:28,326 INFO L93 Difference]: Finished difference Result 735 states and 979 transitions. [2022-02-20 18:54:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 979 transitions. [2022-02-20 18:54:28,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:28,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:28,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:28,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 503 transitions. [2022-02-20 18:54:28,337 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 503 transitions. Word has length 76 [2022-02-20 18:54:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:28,338 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 503 transitions. [2022-02-20 18:54:28,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 503 transitions. [2022-02-20 18:54:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:54:28,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:28,339 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:28,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:54:28,340 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:54:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1538930145, now seen corresponding path program 1 times [2022-02-20 18:54:28,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:28,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564185276] [2022-02-20 18:54:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:28,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:28,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {21548#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {21550#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:54:28,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {21550#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {21551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {21552#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {21552#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {21552#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {21552#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id5~0 >= 0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st5~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send5~0 == ~id5~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode5~0 % 256; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id5~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id5~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id5~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:28,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {21553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {21554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:54:28,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {21554#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:54:28,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {21554#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {21554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:54:28,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {21554#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {21554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:54:28,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {21554#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {21554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:54:28,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {21554#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {21554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:54:28,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {21554#(not (= ~nomsg~0 ~p2_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {21554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:54:28,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {21554#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {21554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:54:28,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {21554#(not (= ~nomsg~0 ~p2_new~0))} assume ~send5~0 != ~nomsg~0; {21554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:54:28,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {21554#(not (= ~nomsg~0 ~p2_new~0))} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 5); {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,518 INFO L290 TraceCheckUtils]: 51: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_9351~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_9351~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,523 INFO L290 TraceCheckUtils]: 63: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {21555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:28,523 INFO L290 TraceCheckUtils]: 64: Hoare triple {21555#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21556#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} is VALID [2022-02-20 18:54:28,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {21556#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {21549#false} is VALID [2022-02-20 18:54:28,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {21549#false} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {21549#false} is VALID [2022-02-20 18:54:28,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {21549#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21549#false} is VALID [2022-02-20 18:54:28,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {21549#false} assume !(main_~node4__m4~8#1 != ~nomsg~0);~mode4~0 := 0; {21549#false} is VALID [2022-02-20 18:54:28,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {21549#false} havoc main_~node5__m5~14#1;main_~node5__m5~14#1 := ~nomsg~0; {21549#false} is VALID [2022-02-20 18:54:28,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {21549#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~14#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21549#false} is VALID [2022-02-20 18:54:28,525 INFO L290 TraceCheckUtils]: 71: Hoare triple {21549#false} assume !(main_~node5__m5~14#1 != ~nomsg~0);~mode5~0 := 0; {21549#false} is VALID [2022-02-20 18:54:28,525 INFO L290 TraceCheckUtils]: 72: Hoare triple {21549#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~24#1; {21549#false} is VALID [2022-02-20 18:54:28,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {21549#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~24#1 := 0;~__return_8194~0 := main_~check__tmp~24#1;main_~main__c1~0#1 := ~__return_8194~0;havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~17#1;main_~assert__arg~17#1 := main_~__tmp_18~0#1; {21549#false} is VALID [2022-02-20 18:54:28,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {21549#false} assume 0 == main_~assert__arg~17#1 % 256; {21549#false} is VALID [2022-02-20 18:54:28,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {21549#false} assume !false; {21549#false} is VALID [2022-02-20 18:54:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:28,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:28,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564185276] [2022-02-20 18:54:28,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564185276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:28,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:28,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:54:28,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430364516] [2022-02-20 18:54:28,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:28,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 18:54:28,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:28,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:28,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:28,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:54:28,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:28,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:54:28,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:54:28,584 INFO L87 Difference]: Start difference. First operand 390 states and 503 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:33,846 INFO L93 Difference]: Finished difference Result 820 states and 1103 transitions. [2022-02-20 18:54:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:54:33,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 18:54:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1103 transitions. [2022-02-20 18:54:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1103 transitions. [2022-02-20 18:54:33,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 1103 transitions. [2022-02-20 18:54:34,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1103 edges. 1103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:34,692 INFO L225 Difference]: With dead ends: 820 [2022-02-20 18:54:34,692 INFO L226 Difference]: Without dead ends: 731 [2022-02-20 18:54:34,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:54:34,697 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 2725 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:34,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2725 Valid, 1632 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 18:54:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-02-20 18:54:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 390. [2022-02-20 18:54:35,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:35,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 731 states. Second operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:35,542 INFO L74 IsIncluded]: Start isIncluded. First operand 731 states. Second operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:35,542 INFO L87 Difference]: Start difference. First operand 731 states. Second operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:35,564 INFO L93 Difference]: Finished difference Result 731 states and 974 transitions. [2022-02-20 18:54:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 974 transitions. [2022-02-20 18:54:35,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:35,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:35,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 731 states. [2022-02-20 18:54:35,566 INFO L87 Difference]: Start difference. First operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 731 states. [2022-02-20 18:54:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:35,587 INFO L93 Difference]: Finished difference Result 731 states and 974 transitions. [2022-02-20 18:54:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 974 transitions. [2022-02-20 18:54:35,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:35,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:35,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:35,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 502 transitions. [2022-02-20 18:54:35,600 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 502 transitions. Word has length 76 [2022-02-20 18:54:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:35,601 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 502 transitions. [2022-02-20 18:54:35,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 502 transitions. [2022-02-20 18:54:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:54:35,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:35,602 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:35,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:54:35,603 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-02-20 18:54:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash 684383254, now seen corresponding path program 1 times [2022-02-20 18:54:35,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:35,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353664845] [2022-02-20 18:54:35,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:35,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:35,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {24580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_9351~0 := 0;~__return_6349~0 := 0;~__return_6448~0 := 0;~__return_6747~0 := 0;~__return_6940~0 := 0;~__return_7116~0 := 0;~__return_7329~0 := 0;~__return_7517~0 := 0;~__return_7701~0 := 0;~__return_7871~0 := 0;~__return_8084~0 := 0;~__return_8282~0 := 0;~__return_8464~0 := 0;~__return_8632~0 := 0;~__return_8826~0 := 0;~__return_9006~0 := 0;~__return_9174~0 := 0;~__return_6656~0 := 0;~__return_6821~0 := 0;~__return_7026~0 := 0;~__return_7192~0 := 0;~__return_7427~0 := 0;~__return_7593~0 := 0;~__return_7789~0 := 0;~__return_8194~0 := 0;~__return_8356~0 := 0;~__return_8550~0 := 0;~__return_8924~0 := 0;~__return_9291~0 := 0;~__return_9205~0 := 0;~__return_9125~0 := 0;~__return_9037~0 := 0;~__return_8969~0 := 0;~__return_8863~0 := 0;~__return_8765~0 := 0;~__return_8663~0 := 0;~__return_8595~0 := 0;~__return_8501~0 := 0;~__return_8415~0 := 0;~__return_8319~0 := 0;~__return_8245~0 := 0;~__return_8121~0 := 0;~__return_8008~0 := 0;~__return_7902~0 := 0;~__return_7834~0 := 0;~__return_7740~0 := 0;~__return_7652~0 := 0;~__return_7556~0 := 0;~__return_7480~0 := 0;~__return_7366~0 := 0;~__return_7265~0 := 0;~__return_7155~0 := 0;~__return_7079~0 := 0;~__return_6977~0 := 0;~__return_6888~0 := 0;~__return_6784~0 := 0;~__return_6707~0 := 0;~__return_6568~0 := 0;~__return_6256~0 := 0; {24582#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:54:35,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {24582#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:35,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:35,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:35,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:35,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:35,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:35,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {24583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {24584#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:35,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {24584#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {24584#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:54:35,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {24584#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode2~0 % 256; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id3~0 >= 0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~st3~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send3~0 == ~id3~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode3~0 % 256; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id4~0 >= 0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~st4~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send4~0 == ~id4~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode4~0 % 256; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id5~0 >= 0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~st5~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send5~0 == ~id5~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode5~0 % 256; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id2~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id3~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id4~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id5~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id2~0 != ~id3~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id2~0 != ~id4~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id2~0 != ~id5~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id3~0 != ~id4~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id3~0 != ~id5~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send1~0 != ~nomsg~0; {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:54:35,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {24585#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {24586#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:54:35,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {24586#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {24586#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:54:35,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {24586#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume ~send2~0 != ~nomsg~0; {24586#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:54:35,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {24586#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:35,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:35,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~send3~0 != ~nomsg~0; {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:35,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:35,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:35,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~send4~0 != ~nomsg~0; {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:35,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:35,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:35,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~send5~0 != ~nomsg~0; {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:54:35,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {24587#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0;~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(~r1~0 % 256 >= 5); {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_9351~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_9351~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256); {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == ~mode1~0 % 256); {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,913 INFO L290 TraceCheckUtils]: 56: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,913 INFO L290 TraceCheckUtils]: 57: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,914 INFO L290 TraceCheckUtils]: 59: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,914 INFO L290 TraceCheckUtils]: 60: Hoare triple {24588#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {24589#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {24589#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node2__m2~3#1 != ~nomsg~0; {24589#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:54:35,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {24589#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {24590#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:35,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {24590#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {24590#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:35,916 INFO L290 TraceCheckUtils]: 64: Hoare triple {24590#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {24590#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:54:35,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {24590#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {24591#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:54:35,917 INFO L290 TraceCheckUtils]: 66: Hoare triple {24591#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {24581#false} is VALID [2022-02-20 18:54:35,917 INFO L290 TraceCheckUtils]: 67: Hoare triple {24581#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {24581#false} is VALID [2022-02-20 18:54:35,917 INFO L290 TraceCheckUtils]: 68: Hoare triple {24581#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {24581#false} is VALID [2022-02-20 18:54:35,917 INFO L290 TraceCheckUtils]: 69: Hoare triple {24581#false} assume main_~node4__m4~6#1 != ~nomsg~0; {24581#false} is VALID [2022-02-20 18:54:35,918 INFO L290 TraceCheckUtils]: 70: Hoare triple {24581#false} assume !(main_~node4__m4~6#1 > ~id4~0); {24581#false} is VALID [2022-02-20 18:54:35,918 INFO L290 TraceCheckUtils]: 71: Hoare triple {24581#false} assume main_~node4__m4~6#1 == ~id4~0;~st4~0 := 1;~mode4~0 := 0;havoc main_~node5__m5~11#1;main_~node5__m5~11#1 := ~nomsg~0; {24581#false} is VALID [2022-02-20 18:54:35,918 INFO L290 TraceCheckUtils]: 72: Hoare triple {24581#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~11#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {24581#false} is VALID [2022-02-20 18:54:35,918 INFO L290 TraceCheckUtils]: 73: Hoare triple {24581#false} assume !(main_~node5__m5~11#1 != ~nomsg~0);~mode5~0 := 0; {24581#false} is VALID [2022-02-20 18:54:35,918 INFO L290 TraceCheckUtils]: 74: Hoare triple {24581#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~19#1; {24581#false} is VALID [2022-02-20 18:54:35,918 INFO L290 TraceCheckUtils]: 75: Hoare triple {24581#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~19#1 := 0;~__return_7026~0 := main_~check__tmp~19#1;main_~main__c1~0#1 := ~__return_7026~0;havoc main_~__tmp_16~0#1;main_~__tmp_16~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~15#1;main_~assert__arg~15#1 := main_~__tmp_16~0#1; {24581#false} is VALID [2022-02-20 18:54:35,918 INFO L290 TraceCheckUtils]: 76: Hoare triple {24581#false} assume 0 == main_~assert__arg~15#1 % 256; {24581#false} is VALID [2022-02-20 18:54:35,919 INFO L290 TraceCheckUtils]: 77: Hoare triple {24581#false} assume !false; {24581#false} is VALID [2022-02-20 18:54:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:35,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:35,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353664845] [2022-02-20 18:54:35,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353664845] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:35,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:35,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:54:35,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748086175] [2022-02-20 18:54:35,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:35,921 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:54:35,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:35,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:35,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:35,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:54:35,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:35,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:54:35,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:54:35,994 INFO L87 Difference]: Start difference. First operand 390 states and 502 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)