./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-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.4.1.ufo.BOUNDED-8.pals.c.v+sep-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 c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:51:36,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:51:36,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:51:36,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:51:36,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:51:36,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:51:36,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:51:36,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:51:36,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:51:36,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:51:36,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:51:36,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:51:36,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:51:36,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:51:36,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:51:36,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:51:36,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:51:36,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:51:36,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:51:36,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:51:36,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:51:36,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:51:36,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:51:36,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:51:36,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:51:36,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:51:36,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:51:36,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:51:36,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:51:36,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:51:36,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:51:36,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:51:36,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:51:36,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:51:36,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:51:36,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:51:36,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:51:36,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:51:36,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:51:36,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:51:36,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:51:36,075 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:51:36,095 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:51:36,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:51:36,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:51:36,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:51:36,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:51:36,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:51:36,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:51:36,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:51:36,099 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:51:36,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:51:36,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:51:36,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:51:36,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:51:36,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:51:36,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:51:36,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:51:36,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:51:36,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:51:36,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:51:36,101 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:51:36,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:51:36,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:51:36,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:51:36,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:51:36,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:36,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:51:36,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:51:36,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:51:36,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:51:36,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:51:36,103 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:51:36,103 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:51:36,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:51:36,103 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 -> c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 [2022-02-20 18:51:36,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:51:36,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:51:36,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:51:36,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:51:36,346 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:51:36,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2022-02-20 18:51:36,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81b9e545/da8872429af64395b376519be639dc10/FLAG41eb23165 [2022-02-20 18:51:36,848 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:51:36,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2022-02-20 18:51:36,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81b9e545/da8872429af64395b376519be639dc10/FLAG41eb23165 [2022-02-20 18:51:37,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81b9e545/da8872429af64395b376519be639dc10 [2022-02-20 18:51:37,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:51:37,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:51:37,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:37,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:51:37,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:51:37,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:37" (1/1) ... [2022-02-20 18:51:37,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a31d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:37, skipping insertion in model container [2022-02-20 18:51:37,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:37" (1/1) ... [2022-02-20 18:51:37,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:51:37,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:51:37,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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2022-02-20 18:51:37,704 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2022-02-20 18:51:37,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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2022-02-20 18:51:37,736 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2022-02-20 18:51:37,749 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2022-02-20 18:51:37,757 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2022-02-20 18:51:37,772 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2022-02-20 18:51:37,786 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2022-02-20 18:51:37,799 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2022-02-20 18:51:37,811 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2022-02-20 18:51:37,822 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2022-02-20 18:51:37,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:37,872 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:51:37,929 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2022-02-20 18:51:37,939 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2022-02-20 18:51:37,944 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2022-02-20 18:51:37,949 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2022-02-20 18:51:37,954 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2022-02-20 18:51:37,959 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2022-02-20 18:51:37,964 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2022-02-20 18:51:37,969 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2022-02-20 18:51:37,982 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2022-02-20 18:51:37,987 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2022-02-20 18:51:37,991 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2022-02-20 18:51:38,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:38,027 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:51:38,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38 WrapperNode [2022-02-20 18:51:38,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:38,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:38,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:51:38,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:51:38,035 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:51:38" (1/1) ... [2022-02-20 18:51:38,055 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:51:38" (1/1) ... [2022-02-20 18:51:38,128 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2770 [2022-02-20 18:51:38,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:38,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:51:38,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:51:38,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:51:38,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38" (1/1) ... [2022-02-20 18:51:38,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38" (1/1) ... [2022-02-20 18:51:38,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38" (1/1) ... [2022-02-20 18:51:38,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38" (1/1) ... [2022-02-20 18:51:38,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38" (1/1) ... [2022-02-20 18:51:38,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38" (1/1) ... [2022-02-20 18:51:38,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38" (1/1) ... [2022-02-20 18:51:38,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:51:38,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:51:38,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:51:38,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:51:38,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38" (1/1) ... [2022-02-20 18:51:38,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:38,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:51:38,233 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:51:38,249 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:51:38,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:51:38,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:51:38,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:51:38,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:51:38,428 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:51:38,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:51:39,704 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:51:39,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:51:39,713 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:51:39,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:39 BoogieIcfgContainer [2022-02-20 18:51:39,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:51:39,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:51:39,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:51:39,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:51:39,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:51:37" (1/3) ... [2022-02-20 18:51:39,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98ffa1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:39, skipping insertion in model container [2022-02-20 18:51:39,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:38" (2/3) ... [2022-02-20 18:51:39,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98ffa1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:39, skipping insertion in model container [2022-02-20 18:51:39,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:39" (3/3) ... [2022-02-20 18:51:39,729 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2022-02-20 18:51:39,735 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:51:39,735 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-20 18:51:39,804 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:51:39,809 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:51:39,809 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-20 18:51:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 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:51:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:51:39,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:39,839 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] [2022-02-20 18:51:39,840 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash 646480323, now seen corresponding path program 1 times [2022-02-20 18:51:39,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:39,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975191586] [2022-02-20 18:51:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:40,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {573#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {575#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,212 INFO L290 TraceCheckUtils]: 4: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {576#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:51:40,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {576#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {576#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:51:40,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {576#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {577#(<= (+ ~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;main_~main__i2~0#1 := 0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {577#(<= (+ ~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; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send2~0 != ~nomsg~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~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; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~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~3#1;main_~node4__m4~3#1 := ~nomsg~0; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~1#1; {577#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:40,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {577#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~1#1 := ~p4_new~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~1#1 % 256 else main_~node4____CPAchecker_TMP_0~1#1 % 256 - 256);~mode4~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;havoc main_~check__tmp~6#1; {574#false} is VALID [2022-02-20 18:51:40,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {574#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {574#false} is VALID [2022-02-20 18:51:40,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {574#false} assume !(~r1~0 >= 4); {574#false} is VALID [2022-02-20 18:51:40,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {574#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {574#false} is VALID [2022-02-20 18:51:40,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {574#false} assume ~r1~0 < 4;main_~check__tmp~6#1 := 1;~__return_758~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_758~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {574#false} is VALID [2022-02-20 18:51:40,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {574#false} assume !(0 == main_~assert__arg~3#1 % 256);main_~main____CPAchecker_TMP_0~3#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {574#false} is VALID [2022-02-20 18:51:40,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {574#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~4#1;main_~node1__m1~4#1 := ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {574#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~4#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {574#false} assume !(main_~node1__m1~4#1 != ~nomsg~0);~mode1~0 := 0;~__tmp_2185_0~0 := main_~main____CPAchecker_TMP_0~3#1; {574#false} is VALID [2022-02-20 18:51:40,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {574#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2185_0~0;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {574#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~4#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {574#false} assume main_~node2__m2~4#1 != ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {574#false} assume !(main_~node2__m2~4#1 > ~id2~0); {574#false} is VALID [2022-02-20 18:51:40,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {574#false} assume main_~node2__m2~4#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {574#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {574#false} assume main_~node3__m3~4#1 != ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {574#false} assume !(main_~node3__m3~4#1 > ~id3~0); {574#false} is VALID [2022-02-20 18:51:40,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {574#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~5#1;main_~node4__m4~5#1 := ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {574#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {574#false} is VALID [2022-02-20 18:51:40,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {574#false} assume !(main_~node4__m4~5#1 != ~nomsg~0);~mode4~0 := 0;~__tmp_2255_0~0 := main_~main____CPAchecker_TMP_0~3#1; {574#false} is VALID [2022-02-20 18:51:40,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {574#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2255_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;havoc main_~check__tmp~7#1; {574#false} is VALID [2022-02-20 18:51:40,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {574#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_2270~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_2270~0;havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~4#1;main_~assert__arg~4#1 := main_~__tmp_5~0#1; {574#false} is VALID [2022-02-20 18:51:40,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {574#false} assume 0 == main_~assert__arg~4#1 % 256; {574#false} is VALID [2022-02-20 18:51:40,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {574#false} assume !false; {574#false} is VALID [2022-02-20 18:51:40,240 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:51:40,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:40,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975191586] [2022-02-20 18:51:40,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975191586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:40,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:40,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:40,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538446271] [2022-02-20 18:51:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:40,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-02-20 18:51:40,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:40,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:40,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:40,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:40,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:40,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:40,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:40,321 INFO L87 Difference]: Start difference. First operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 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 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:41,756 INFO L93 Difference]: Finished difference Result 785 states and 1334 transitions. [2022-02-20 18:51:41,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:41,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-02-20 18:51:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1334 transitions. [2022-02-20 18:51:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1334 transitions. [2022-02-20 18:51:41,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1334 transitions. [2022-02-20 18:51:42,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1334 edges. 1334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:42,775 INFO L225 Difference]: With dead ends: 785 [2022-02-20 18:51:42,775 INFO L226 Difference]: Without dead ends: 503 [2022-02-20 18:51:42,778 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:51:42,780 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 2416 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:42,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2416 Valid, 551 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-20 18:51:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2022-02-20 18:51:42,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:42,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 503 states, 492 states have (on average 1.274390243902439) internal successors, (627), 502 states have internal predecessors, (627), 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:51:42,966 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 503 states, 492 states have (on average 1.274390243902439) internal successors, (627), 502 states have internal predecessors, (627), 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:51:42,967 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 503 states, 492 states have (on average 1.274390243902439) internal successors, (627), 502 states have internal predecessors, (627), 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:51:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:42,987 INFO L93 Difference]: Finished difference Result 503 states and 627 transitions. [2022-02-20 18:51:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 627 transitions. [2022-02-20 18:51:42,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:42,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:42,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 503 states, 492 states have (on average 1.274390243902439) internal successors, (627), 502 states have internal predecessors, (627), 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 503 states. [2022-02-20 18:51:42,991 INFO L87 Difference]: Start difference. First operand has 503 states, 492 states have (on average 1.274390243902439) internal successors, (627), 502 states have internal predecessors, (627), 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 503 states. [2022-02-20 18:51:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:43,010 INFO L93 Difference]: Finished difference Result 503 states and 627 transitions. [2022-02-20 18:51:43,011 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 627 transitions. [2022-02-20 18:51:43,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:43,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:43,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:43,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 492 states have (on average 1.274390243902439) internal successors, (627), 502 states have internal predecessors, (627), 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:51:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 627 transitions. [2022-02-20 18:51:43,032 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 627 transitions. Word has length 60 [2022-02-20 18:51:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:43,032 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 627 transitions. [2022-02-20 18:51:43,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 627 transitions. [2022-02-20 18:51:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:51:43,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:43,034 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] [2022-02-20 18:51:43,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:51:43,034 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 221242932, now seen corresponding path program 1 times [2022-02-20 18:51:43,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:43,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779757083] [2022-02-20 18:51:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:43,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:43,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {3184#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {3186#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:43,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {3186#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {3186#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:43,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {3186#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {3186#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:43,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {3186#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {3186#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:43,139 INFO L290 TraceCheckUtils]: 4: Hoare triple {3186#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {3186#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:43,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {3186#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {3186#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:43,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {3186#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {3186#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:43,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {3186#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {3187#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:43,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {3187#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {3187#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:43,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {3187#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {3188#(<= (+ ~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;main_~main__i2~0#1 := 0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {3188#(<= (+ ~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; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {3188#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3188#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:43,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {3188#(<= (+ ~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~5#1;main_~node3__m3~5#1 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {3185#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~1#1; {3185#false} is VALID [2022-02-20 18:51:43,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {3185#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~1#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~1#1 % 256 else main_~node3____CPAchecker_TMP_0~1#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~9#1;main_~node4__m4~9#1 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {3185#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~3#1; {3185#false} is VALID [2022-02-20 18:51:43,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {3185#false} assume ~send4~0 != ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {3185#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~3#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~3#1 % 256 else main_~node4____CPAchecker_TMP_0~3#1 % 256 - 256);~mode4~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;havoc main_~check__tmp~12#1; {3185#false} is VALID [2022-02-20 18:51:43,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {3185#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {3185#false} is VALID [2022-02-20 18:51:43,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {3185#false} assume !(~r1~0 >= 4); {3185#false} is VALID [2022-02-20 18:51:43,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {3185#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {3185#false} is VALID [2022-02-20 18:51:43,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {3185#false} assume ~r1~0 < 4;main_~check__tmp~12#1 := 1;~__return_716~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_716~0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~8#1;main_~assert__arg~8#1 := main_~__tmp_9~0#1; {3185#false} is VALID [2022-02-20 18:51:43,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {3185#false} assume !(0 == main_~assert__arg~8#1 % 256);main_~main____CPAchecker_TMP_0~6#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {3185#false} is VALID [2022-02-20 18:51:43,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {3185#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~7#1;main_~node1__m1~7#1 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {3185#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~7#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} assume main_~node1__m1~7#1 != ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume !(main_~node1__m1~7#1 > ~id1~0); {3185#false} is VALID [2022-02-20 18:51:43,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} assume main_~node1__m1~7#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~7#1;main_~node2__m2~7#1 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {3185#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~7#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {3185#false} assume main_~node2__m2~7#1 != ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {3185#false} assume !(main_~node2__m2~7#1 > ~id2~0); {3185#false} is VALID [2022-02-20 18:51:43,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {3185#false} assume main_~node2__m2~7#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {3185#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {3185#false} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0;~__tmp_1912_0~0 := main_~main____CPAchecker_TMP_0~6#1; {3185#false} is VALID [2022-02-20 18:51:43,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {3185#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_1912_0~0;havoc main_~node4__m4~10#1;main_~node4__m4~10#1 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {3185#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~10#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:51:43,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {3185#false} assume !(main_~node4__m4~10#1 != ~nomsg~0);~mode4~0 := 0;~__tmp_1924_0~0 := main_~main____CPAchecker_TMP_0~6#1; {3185#false} is VALID [2022-02-20 18:51:43,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {3185#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_1924_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;havoc main_~check__tmp~13#1; {3185#false} is VALID [2022-02-20 18:51:43,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {3185#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~13#1 := 0;~__return_1939~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_1939~0;havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~9#1;main_~assert__arg~9#1 := main_~__tmp_10~0#1; {3185#false} is VALID [2022-02-20 18:51:43,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {3185#false} assume 0 == main_~assert__arg~9#1 % 256; {3185#false} is VALID [2022-02-20 18:51:43,169 INFO L290 TraceCheckUtils]: 59: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-02-20 18:51:43,170 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:51:43,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:43,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779757083] [2022-02-20 18:51:43,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779757083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:43,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:43,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:43,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198644223] [2022-02-20 18:51:43,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:43,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-02-20 18:51:43,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:43,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:43,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:43,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:43,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:43,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:43,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:43,208 INFO L87 Difference]: Start difference. First operand 503 states and 627 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,119 INFO L93 Difference]: Finished difference Result 637 states and 796 transitions. [2022-02-20 18:51:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:44,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-02-20 18:51:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2022-02-20 18:51:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2022-02-20 18:51:44,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 796 transitions. [2022-02-20 18:51:44,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 796 edges. 796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:44,688 INFO L225 Difference]: With dead ends: 637 [2022-02-20 18:51:44,688 INFO L226 Difference]: Without dead ends: 381 [2022-02-20 18:51:44,689 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:51:44,690 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1366 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:44,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 266 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-02-20 18:51:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-02-20 18:51:44,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:44,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 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:51:44,955 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 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:51:44,956 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 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:51:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,964 INFO L93 Difference]: Finished difference Result 381 states and 476 transitions. [2022-02-20 18:51:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2022-02-20 18:51:44,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 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 381 states. [2022-02-20 18:51:44,965 INFO L87 Difference]: Start difference. First operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 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 381 states. [2022-02-20 18:51:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,973 INFO L93 Difference]: Finished difference Result 381 states and 476 transitions. [2022-02-20 18:51:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2022-02-20 18:51:44,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:44,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 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:51:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2022-02-20 18:51:44,982 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 60 [2022-02-20 18:51:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:44,983 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2022-02-20 18:51:44,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2022-02-20 18:51:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:51:44,984 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:44,984 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] [2022-02-20 18:51:44,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:51:44,984 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:44,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2147344789, now seen corresponding path program 1 times [2022-02-20 18:51:44,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:44,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770390742] [2022-02-20 18:51:44,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:44,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:45,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {5229#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {5231#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:45,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {5231#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {5231#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:45,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {5231#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {5231#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:45,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {5231#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {5232#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:45,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {5232#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {5232#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:45,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {5232#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {5233#(<= (+ ~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;main_~main__i2~0#1 := 0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {5233#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5233#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:45,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {5233#(<= (+ ~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~9#1;main_~node2__m2~9#1 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {5230#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~1#1; {5230#false} is VALID [2022-02-20 18:51:45,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {5230#false} assume ~send2~0 != ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {5230#false} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~1#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~1#1 % 256 else main_~node2____CPAchecker_TMP_0~1#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~10#1;main_~node3__m3~10#1 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {5230#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {5230#false} is VALID [2022-02-20 18:51:45,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {5230#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~15#1;main_~node4__m4~15#1 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {5230#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~5#1; {5230#false} is VALID [2022-02-20 18:51:45,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {5230#false} assume ~send4~0 != ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {5230#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~5#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~5#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~5#1 % 256 else main_~node4____CPAchecker_TMP_0~5#1 % 256 - 256);~mode4~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;havoc main_~check__tmp~20#1; {5230#false} is VALID [2022-02-20 18:51:45,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {5230#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {5230#false} is VALID [2022-02-20 18:51:45,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {5230#false} assume !(~r1~0 >= 4); {5230#false} is VALID [2022-02-20 18:51:45,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {5230#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {5230#false} is VALID [2022-02-20 18:51:45,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {5230#false} assume ~r1~0 < 4;main_~check__tmp~20#1 := 1;~__return_660~0 := main_~check__tmp~20#1;main_~main__c1~0#1 := ~__return_660~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; {5230#false} is VALID [2022-02-20 18:51:45,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {5230#false} assume !(0 == main_~assert__arg~16#1 % 256);main_~main____CPAchecker_TMP_0~10#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {5230#false} is VALID [2022-02-20 18:51:45,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {5230#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~11#1;main_~node1__m1~11#1 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {5230#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~11#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {5230#false} assume main_~node1__m1~11#1 != ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {5230#false} assume !(main_~node1__m1~11#1 > ~id1~0); {5230#false} is VALID [2022-02-20 18:51:45,112 INFO L290 TraceCheckUtils]: 46: Hoare triple {5230#false} assume main_~node1__m1~11#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~12#1;main_~node2__m2~12#1 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {5230#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~12#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {5230#false} assume !(main_~node2__m2~12#1 != ~nomsg~0);~mode2~0 := 0;~__tmp_1445_0~0 := main_~main____CPAchecker_TMP_0~10#1; {5230#false} is VALID [2022-02-20 18:51:45,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {5230#false} main_~main____CPAchecker_TMP_0~10#1 := ~__tmp_1445_0~0;havoc main_~node3__m3~13#1;main_~node3__m3~13#1 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {5230#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~13#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {5230#false} assume main_~node3__m3~13#1 != ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {5230#false} assume !(main_~node3__m3~13#1 > ~id3~0); {5230#false} is VALID [2022-02-20 18:51:45,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {5230#false} assume main_~node3__m3~13#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~16#1;main_~node4__m4~16#1 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {5230#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~16#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:51:45,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {5230#false} assume !(main_~node4__m4~16#1 != ~nomsg~0);~mode4~0 := 0;~__tmp_1486_0~0 := main_~main____CPAchecker_TMP_0~10#1; {5230#false} is VALID [2022-02-20 18:51:45,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {5230#false} main_~main____CPAchecker_TMP_0~10#1 := ~__tmp_1486_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;havoc main_~check__tmp~21#1; {5230#false} is VALID [2022-02-20 18:51:45,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {5230#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~21#1 := 0;~__return_1501~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_1501~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; {5230#false} is VALID [2022-02-20 18:51:45,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {5230#false} assume 0 == main_~assert__arg~17#1 % 256; {5230#false} is VALID [2022-02-20 18:51:45,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {5230#false} assume !false; {5230#false} is VALID [2022-02-20 18:51:45,114 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:51:45,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:45,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770390742] [2022-02-20 18:51:45,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770390742] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:45,115 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:45,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:45,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056200377] [2022-02-20 18:51:45,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:45,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-02-20 18:51:45,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:45,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:45,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:45,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:45,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:45,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:45,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:45,171 INFO L87 Difference]: Start difference. First operand 381 states and 476 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:46,508 INFO L93 Difference]: Finished difference Result 713 states and 908 transitions. [2022-02-20 18:51:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:46,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-02-20 18:51:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 908 transitions. [2022-02-20 18:51:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 908 transitions. [2022-02-20 18:51:46,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 908 transitions. [2022-02-20 18:51:47,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 908 edges. 908 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:47,113 INFO L225 Difference]: With dead ends: 713 [2022-02-20 18:51:47,114 INFO L226 Difference]: Without dead ends: 509 [2022-02-20 18:51:47,114 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:51:47,115 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 1661 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:47,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1661 Valid, 371 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-02-20 18:51:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 450. [2022-02-20 18:51:47,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:47,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 509 states. Second operand has 450 states, 439 states have (on average 1.3416856492027336) internal successors, (589), 449 states have internal predecessors, (589), 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:51:47,590 INFO L74 IsIncluded]: Start isIncluded. First operand 509 states. Second operand has 450 states, 439 states have (on average 1.3416856492027336) internal successors, (589), 449 states have internal predecessors, (589), 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:51:47,591 INFO L87 Difference]: Start difference. First operand 509 states. Second operand has 450 states, 439 states have (on average 1.3416856492027336) internal successors, (589), 449 states have internal predecessors, (589), 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:51:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:47,602 INFO L93 Difference]: Finished difference Result 509 states and 647 transitions. [2022-02-20 18:51:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 647 transitions. [2022-02-20 18:51:47,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:47,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:47,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 450 states, 439 states have (on average 1.3416856492027336) internal successors, (589), 449 states have internal predecessors, (589), 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 509 states. [2022-02-20 18:51:47,604 INFO L87 Difference]: Start difference. First operand has 450 states, 439 states have (on average 1.3416856492027336) internal successors, (589), 449 states have internal predecessors, (589), 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 509 states. [2022-02-20 18:51:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:47,616 INFO L93 Difference]: Finished difference Result 509 states and 647 transitions. [2022-02-20 18:51:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 647 transitions. [2022-02-20 18:51:47,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:47,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:47,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:47,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 439 states have (on average 1.3416856492027336) internal successors, (589), 449 states have internal predecessors, (589), 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:51:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 589 transitions. [2022-02-20 18:51:47,628 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 589 transitions. Word has length 60 [2022-02-20 18:51:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:47,628 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 589 transitions. [2022-02-20 18:51:47,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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:51:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 589 transitions. [2022-02-20 18:51:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:51:47,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:47,629 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] [2022-02-20 18:51:47,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:51:47,630 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 604643521, now seen corresponding path program 1 times [2022-02-20 18:51:47,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:47,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986796717] [2022-02-20 18:51:47,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:47,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:47,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {7754#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {7756#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {7756#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {7756#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {7757#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:47,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {7757#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {7757#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:47,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {7757#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {7758#(<= (+ ~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;main_~main__i2~0#1 := 0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {7758#(<= (+ ~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; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {7758#(<= (+ ~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; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {7758#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7758#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:47,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {7758#(<= (+ ~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~3#1;main_~node4__m4~3#1 := ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {7755#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~1#1; {7755#false} is VALID [2022-02-20 18:51:47,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {7755#false} assume ~send4~0 != ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {7755#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~1#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~1#1 % 256 else main_~node4____CPAchecker_TMP_0~1#1 % 256 - 256);~mode4~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;havoc main_~check__tmp~4#1; {7755#false} is VALID [2022-02-20 18:51:47,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {7755#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {7755#false} is VALID [2022-02-20 18:51:47,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {7755#false} assume !(~r1~0 >= 4); {7755#false} is VALID [2022-02-20 18:51:47,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {7755#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {7755#false} is VALID [2022-02-20 18:51:47,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {7755#false} assume ~r1~0 < 4;main_~check__tmp~4#1 := 1;~__return_772~0 := main_~check__tmp~4#1;main_~main__c1~0#1 := ~__return_772~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {7755#false} is VALID [2022-02-20 18:51:47,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {7755#false} assume !(0 == main_~assert__arg~2#1 % 256);main_~main____CPAchecker_TMP_0~2#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {7755#false} is VALID [2022-02-20 18:51:47,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {7755#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~3#1;main_~node1__m1~3#1 := ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {7755#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~3#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {7755#false} assume !(main_~node1__m1~3#1 != ~nomsg~0);~mode1~0 := 0; {7755#false} is VALID [2022-02-20 18:51:47,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {7755#false} ~__tmp_2185_0~0 := main_~main____CPAchecker_TMP_0~2#1; {7755#false} is VALID [2022-02-20 18:51:47,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {7755#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2185_0~0;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {7755#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~4#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {7755#false} assume main_~node2__m2~4#1 != ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {7755#false} assume !(main_~node2__m2~4#1 > ~id2~0); {7755#false} is VALID [2022-02-20 18:51:47,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {7755#false} assume main_~node2__m2~4#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {7755#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {7755#false} assume main_~node3__m3~4#1 != ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {7755#false} assume !(main_~node3__m3~4#1 > ~id3~0); {7755#false} is VALID [2022-02-20 18:51:47,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {7755#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~5#1;main_~node4__m4~5#1 := ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {7755#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7755#false} is VALID [2022-02-20 18:51:47,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {7755#false} assume !(main_~node4__m4~5#1 != ~nomsg~0);~mode4~0 := 0;~__tmp_2255_0~0 := main_~main____CPAchecker_TMP_0~3#1; {7755#false} is VALID [2022-02-20 18:51:47,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {7755#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2255_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;havoc main_~check__tmp~7#1; {7755#false} is VALID [2022-02-20 18:51:47,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {7755#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_2270~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_2270~0;havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~4#1;main_~assert__arg~4#1 := main_~__tmp_5~0#1; {7755#false} is VALID [2022-02-20 18:51:47,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {7755#false} assume 0 == main_~assert__arg~4#1 % 256; {7755#false} is VALID [2022-02-20 18:51:47,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {7755#false} assume !false; {7755#false} is VALID [2022-02-20 18:51:47,731 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:51:47,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:47,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986796717] [2022-02-20 18:51:47,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986796717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:47,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:47,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:47,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786323690] [2022-02-20 18:51:47,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:47,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-02-20 18:51:47,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:47,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:51:47,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:47,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:47,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:47,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:47,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:47,780 INFO L87 Difference]: Start difference. First operand 450 states and 589 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:51:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:48,574 INFO L93 Difference]: Finished difference Result 606 states and 794 transitions. [2022-02-20 18:51:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:48,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-02-20 18:51:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:51:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2022-02-20 18:51:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:51:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2022-02-20 18:51:48,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 542 transitions. [2022-02-20 18:51:48,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 542 edges. 542 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:48,936 INFO L225 Difference]: With dead ends: 606 [2022-02-20 18:51:48,936 INFO L226 Difference]: Without dead ends: 357 [2022-02-20 18:51:48,937 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:51:48,937 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 902 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:48,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [902 Valid, 209 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-02-20 18:51:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2022-02-20 18:51:49,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:49,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 357 states, 346 states have (on average 1.346820809248555) internal successors, (466), 356 states have internal predecessors, (466), 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:51:49,336 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 357 states, 346 states have (on average 1.346820809248555) internal successors, (466), 356 states have internal predecessors, (466), 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:51:49,336 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 357 states, 346 states have (on average 1.346820809248555) internal successors, (466), 356 states have internal predecessors, (466), 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:51:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:49,342 INFO L93 Difference]: Finished difference Result 357 states and 466 transitions. [2022-02-20 18:51:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 466 transitions. [2022-02-20 18:51:49,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:49,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:49,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.346820809248555) internal successors, (466), 356 states have internal predecessors, (466), 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 357 states. [2022-02-20 18:51:49,343 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.346820809248555) internal successors, (466), 356 states have internal predecessors, (466), 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 357 states. [2022-02-20 18:51:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:49,351 INFO L93 Difference]: Finished difference Result 357 states and 466 transitions. [2022-02-20 18:51:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 466 transitions. [2022-02-20 18:51:49,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:49,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:49,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:49,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.346820809248555) internal successors, (466), 356 states have internal predecessors, (466), 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:51:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 466 transitions. [2022-02-20 18:51:49,360 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 466 transitions. Word has length 62 [2022-02-20 18:51:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:49,360 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 466 transitions. [2022-02-20 18:51:49,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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:51:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 466 transitions. [2022-02-20 18:51:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:51:49,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:49,362 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] [2022-02-20 18:51:49,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:51:49,363 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash -699288056, now seen corresponding path program 1 times [2022-02-20 18:51:49,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:49,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172133122] [2022-02-20 18:51:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:49,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {9727#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {9729#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {9729#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {9730#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:49,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {9730#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {9730#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:49,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {9730#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {9731#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:49,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {9731#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {9731#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:49,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {9731#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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;main_~main__i2~0#1 := 0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:49,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {9732#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~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; {9733#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:49,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {9733#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {9733#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:49,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {9733#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {9733#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:49,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {9733#(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; {9733#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:49,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {9733#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {9733#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:49,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {9733#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {9733#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:49,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {9733#(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; {9733#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:49,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {9733#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {9733#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:49,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {9733#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {9733#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:49,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {9733#(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;~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;havoc main_~check__tmp~0#1; {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 4); {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,584 INFO L290 TraceCheckUtils]: 47: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {9734#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:49,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {9734#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9735#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:49,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {9735#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {9728#false} is VALID [2022-02-20 18:51:49,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {9728#false} ~__tmp_1664_0~0 := main_~main____CPAchecker_TMP_0~0#1; {9728#false} is VALID [2022-02-20 18:51:49,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {9728#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1664_0~0;havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {9728#false} is VALID [2022-02-20 18:51:49,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {9728#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9728#false} is VALID [2022-02-20 18:51:49,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {9728#false} assume main_~node3__m3~11#1 != ~nomsg~0; {9728#false} is VALID [2022-02-20 18:51:49,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {9728#false} assume !(main_~node3__m3~11#1 > ~id3~0); {9728#false} is VALID [2022-02-20 18:51:49,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {9728#false} assume main_~node3__m3~11#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~13#1;main_~node4__m4~13#1 := ~nomsg~0; {9728#false} is VALID [2022-02-20 18:51:49,586 INFO L290 TraceCheckUtils]: 57: Hoare triple {9728#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~13#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9728#false} is VALID [2022-02-20 18:51:49,586 INFO L290 TraceCheckUtils]: 58: Hoare triple {9728#false} assume !(main_~node4__m4~13#1 != ~nomsg~0);~mode4~0 := 0; {9728#false} is VALID [2022-02-20 18:51:49,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {9728#false} ~__tmp_1486_0~0 := main_~main____CPAchecker_TMP_0~8#1; {9728#false} is VALID [2022-02-20 18:51:49,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {9728#false} main_~main____CPAchecker_TMP_0~10#1 := ~__tmp_1486_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;havoc main_~check__tmp~21#1; {9728#false} is VALID [2022-02-20 18:51:49,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {9728#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~21#1 := 0;~__return_1501~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_1501~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; {9728#false} is VALID [2022-02-20 18:51:49,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {9728#false} assume 0 == main_~assert__arg~17#1 % 256; {9728#false} is VALID [2022-02-20 18:51:49,587 INFO L290 TraceCheckUtils]: 63: Hoare triple {9728#false} assume !false; {9728#false} is VALID [2022-02-20 18:51:49,589 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:51:49,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:49,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172133122] [2022-02-20 18:51:49,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172133122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:49,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:49,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:49,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358991292] [2022-02-20 18:51:49,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:49,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2022-02-20 18:51:49,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:49,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:49,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:49,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:49,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:49,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:49,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:49,643 INFO L87 Difference]: Start difference. First operand 357 states and 466 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:52,816 INFO L93 Difference]: Finished difference Result 810 states and 1097 transitions. [2022-02-20 18:51:52,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2022-02-20 18:51:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 798 transitions. [2022-02-20 18:51:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 798 transitions. [2022-02-20 18:51:52,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 798 transitions. [2022-02-20 18:51:53,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 798 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:53,341 INFO L225 Difference]: With dead ends: 810 [2022-02-20 18:51:53,341 INFO L226 Difference]: Without dead ends: 666 [2022-02-20 18:51:53,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:53,343 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 1115 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:53,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1115 Valid, 923 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:51:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-02-20 18:51:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 357. [2022-02-20 18:51:53,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:53,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 666 states. Second operand has 357 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 356 states have internal predecessors, (465), 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:51:53,847 INFO L74 IsIncluded]: Start isIncluded. First operand 666 states. Second operand has 357 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 356 states have internal predecessors, (465), 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:51:53,848 INFO L87 Difference]: Start difference. First operand 666 states. Second operand has 357 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 356 states have internal predecessors, (465), 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:51:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:53,865 INFO L93 Difference]: Finished difference Result 666 states and 892 transitions. [2022-02-20 18:51:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 892 transitions. [2022-02-20 18:51:53,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:53,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:53,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 356 states have internal predecessors, (465), 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 666 states. [2022-02-20 18:51:53,867 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 356 states have internal predecessors, (465), 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 666 states. [2022-02-20 18:51:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:53,883 INFO L93 Difference]: Finished difference Result 666 states and 892 transitions. [2022-02-20 18:51:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 892 transitions. [2022-02-20 18:51:53,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:53,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:53,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:53,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 356 states have internal predecessors, (465), 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:51:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 465 transitions. [2022-02-20 18:51:53,891 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 465 transitions. Word has length 64 [2022-02-20 18:51:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:53,892 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 465 transitions. [2022-02-20 18:51:53,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 465 transitions. [2022-02-20 18:51:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:51:53,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:53,894 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] [2022-02-20 18:51:53,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:51:53,895 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1796013608, now seen corresponding path program 1 times [2022-02-20 18:51:53,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:53,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550642864] [2022-02-20 18:51:53,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:53,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:54,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {12637#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {12639#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:54,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {12639#(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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {12640#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {12641#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {12641#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {12641#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {12641#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {12642#(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;main_~main__i2~0#1 := 0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {12642#(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; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {12642#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {12642#(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; {12643#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:54,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {12643#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12643#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:54,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {12643#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {12643#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:54,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {12643#(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; {12643#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:54,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {12643#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {12643#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:54,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {12643#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {12643#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:54,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {12643#(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;~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;havoc main_~check__tmp~0#1; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {12644#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:54,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {12644#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12645#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:51:54,066 INFO L290 TraceCheckUtils]: 54: Hoare triple {12645#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0);~mode3~0 := 0; {12638#false} is VALID [2022-02-20 18:51:54,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {12638#false} ~__tmp_2125_0~0 := main_~main____CPAchecker_TMP_0~0#1; {12638#false} is VALID [2022-02-20 18:51:54,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {12638#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_2125_0~0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {12638#false} is VALID [2022-02-20 18:51:54,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {12638#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12638#false} is VALID [2022-02-20 18:51:54,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {12638#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {12638#false} is VALID [2022-02-20 18:51:54,067 INFO L290 TraceCheckUtils]: 59: Hoare triple {12638#false} ~__tmp_1924_0~0 := main_~main____CPAchecker_TMP_0~4#1; {12638#false} is VALID [2022-02-20 18:51:54,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {12638#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_1924_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;havoc main_~check__tmp~13#1; {12638#false} is VALID [2022-02-20 18:51:54,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {12638#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~13#1 := 0;~__return_1939~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_1939~0;havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~9#1;main_~assert__arg~9#1 := main_~__tmp_10~0#1; {12638#false} is VALID [2022-02-20 18:51:54,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {12638#false} assume 0 == main_~assert__arg~9#1 % 256; {12638#false} is VALID [2022-02-20 18:51:54,068 INFO L290 TraceCheckUtils]: 63: Hoare triple {12638#false} assume !false; {12638#false} is VALID [2022-02-20 18:51:54,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:51:54,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:54,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550642864] [2022-02-20 18:51:54,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550642864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:54,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:54,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:54,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336884049] [2022-02-20 18:51:54,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:54,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2022-02-20 18:51:54,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:54,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:54,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:54,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:54,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:54,117 INFO L87 Difference]: Start difference. First operand 357 states and 465 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:58,007 INFO L93 Difference]: Finished difference Result 915 states and 1258 transitions. [2022-02-20 18:51:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:58,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2022-02-20 18:51:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 763 transitions. [2022-02-20 18:51:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 763 transitions. [2022-02-20 18:51:58,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 763 transitions. [2022-02-20 18:51:58,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:58,645 INFO L225 Difference]: With dead ends: 915 [2022-02-20 18:51:58,645 INFO L226 Difference]: Without dead ends: 795 [2022-02-20 18:51:58,646 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:51:58,647 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 1925 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:58,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1925 Valid, 1070 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:51:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-02-20 18:51:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 357. [2022-02-20 18:51:59,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:59,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 357 states, 346 states have (on average 1.3410404624277457) internal successors, (464), 356 states have internal predecessors, (464), 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:51:59,421 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 357 states, 346 states have (on average 1.3410404624277457) internal successors, (464), 356 states have internal predecessors, (464), 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:51:59,422 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 357 states, 346 states have (on average 1.3410404624277457) internal successors, (464), 356 states have internal predecessors, (464), 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:51:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:59,447 INFO L93 Difference]: Finished difference Result 795 states and 1083 transitions. [2022-02-20 18:51:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1083 transitions. [2022-02-20 18:51:59,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:59,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:59,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.3410404624277457) internal successors, (464), 356 states have internal predecessors, (464), 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 795 states. [2022-02-20 18:51:59,450 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.3410404624277457) internal successors, (464), 356 states have internal predecessors, (464), 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 795 states. [2022-02-20 18:51:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:59,474 INFO L93 Difference]: Finished difference Result 795 states and 1083 transitions. [2022-02-20 18:51:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1083 transitions. [2022-02-20 18:51:59,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:59,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:59,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:59,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3410404624277457) internal successors, (464), 356 states have internal predecessors, (464), 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:51:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 464 transitions. [2022-02-20 18:51:59,482 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 464 transitions. Word has length 64 [2022-02-20 18:51:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:59,482 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 464 transitions. [2022-02-20 18:51:59,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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:51:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 464 transitions. [2022-02-20 18:51:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:51:59,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:59,483 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] [2022-02-20 18:51:59,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:51:59,484 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:59,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:59,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1577721816, now seen corresponding path program 1 times [2022-02-20 18:51:59,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:59,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484006816] [2022-02-20 18:51:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:59,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:59,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {15960#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {15962#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:59,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {15962#(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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {15963#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {15964#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {15964#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {15964#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {15964#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~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;main_~main__i2~0#1 := 0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~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; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~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; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 != ~nomsg~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} 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; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 != ~nomsg~0; {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:59,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {15965#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} 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;~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;havoc main_~check__tmp~0#1; {15966#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:59,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {15966#(not (= ~nomsg~0 ~p4_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {15966#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:59,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {15966#(not (= ~nomsg~0 ~p4_old~0))} assume !(~r1~0 >= 4); {15966#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:59,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {15966#(not (= ~nomsg~0 ~p4_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {15966#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:59,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {15966#(not (= ~nomsg~0 ~p4_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {15966#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:59,651 INFO L290 TraceCheckUtils]: 43: Hoare triple {15966#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {15966#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:59,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {15966#(not (= ~nomsg~0 ~p4_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15966#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:59,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {15966#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15967#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:59,652 INFO L290 TraceCheckUtils]: 46: Hoare triple {15967#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {15961#false} is VALID [2022-02-20 18:51:59,652 INFO L290 TraceCheckUtils]: 47: Hoare triple {15961#false} ~__tmp_2410_0~0 := main_~main____CPAchecker_TMP_0~0#1; {15961#false} is VALID [2022-02-20 18:51:59,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {15961#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2410_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {15961#false} is VALID [2022-02-20 18:51:59,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {15961#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15961#false} is VALID [2022-02-20 18:51:59,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {15961#false} assume main_~node2__m2~2#1 != ~nomsg~0; {15961#false} is VALID [2022-02-20 18:51:59,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {15961#false} assume !(main_~node2__m2~2#1 > ~id2~0); {15961#false} is VALID [2022-02-20 18:51:59,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {15961#false} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {15961#false} is VALID [2022-02-20 18:51:59,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {15961#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15961#false} is VALID [2022-02-20 18:51:59,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {15961#false} assume !(main_~node3__m3~2#1 != ~nomsg~0);~mode3~0 := 0; {15961#false} is VALID [2022-02-20 18:51:59,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {15961#false} ~__tmp_2001_0~0 := main_~main____CPAchecker_TMP_0~1#1; {15961#false} is VALID [2022-02-20 18:51:59,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {15961#false} main_~main____CPAchecker_TMP_0~5#1 := ~__tmp_2001_0~0;havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {15961#false} is VALID [2022-02-20 18:51:59,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {15961#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15961#false} is VALID [2022-02-20 18:51:59,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {15961#false} assume main_~node4__m4~8#1 != ~nomsg~0; {15961#false} is VALID [2022-02-20 18:51:59,653 INFO L290 TraceCheckUtils]: 59: Hoare triple {15961#false} assume !(main_~node4__m4~8#1 > ~id4~0); {15961#false} is VALID [2022-02-20 18:51:59,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {15961#false} assume main_~node4__m4~8#1 == ~id4~0;~st4~0 := 1;~mode4~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;havoc main_~check__tmp~11#1; {15961#false} is VALID [2022-02-20 18:51:59,654 INFO L290 TraceCheckUtils]: 61: Hoare triple {15961#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_2045~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_2045~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; {15961#false} is VALID [2022-02-20 18:51:59,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {15961#false} assume 0 == main_~assert__arg~7#1 % 256; {15961#false} is VALID [2022-02-20 18:51:59,654 INFO L290 TraceCheckUtils]: 63: Hoare triple {15961#false} assume !false; {15961#false} is VALID [2022-02-20 18:51:59,655 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:51:59,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:59,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484006816] [2022-02-20 18:51:59,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484006816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:59,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:59,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:51:59,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804618655] [2022-02-20 18:51:59,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:59,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2022-02-20 18:51:59,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:59,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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:51:59,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:59,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:51:59,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:59,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:51:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:51:59,707 INFO L87 Difference]: Start difference. First operand 357 states and 464 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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:52:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:02,159 INFO L93 Difference]: Finished difference Result 724 states and 946 transitions. [2022-02-20 18:52:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:52:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2022-02-20 18:52:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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:52:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 641 transitions. [2022-02-20 18:52:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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:52:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 641 transitions. [2022-02-20 18:52:02,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 641 transitions. [2022-02-20 18:52:02,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 641 edges. 641 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:02,548 INFO L225 Difference]: With dead ends: 724 [2022-02-20 18:52:02,548 INFO L226 Difference]: Without dead ends: 531 [2022-02-20 18:52:02,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:52:02,549 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 1719 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:02,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1719 Valid, 673 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-02-20 18:52:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 357. [2022-02-20 18:52:03,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:03,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 531 states. Second operand has 357 states, 346 states have (on average 1.3381502890173411) internal successors, (463), 356 states have internal predecessors, (463), 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:52:03,368 INFO L74 IsIncluded]: Start isIncluded. First operand 531 states. Second operand has 357 states, 346 states have (on average 1.3381502890173411) internal successors, (463), 356 states have internal predecessors, (463), 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:52:03,368 INFO L87 Difference]: Start difference. First operand 531 states. Second operand has 357 states, 346 states have (on average 1.3381502890173411) internal successors, (463), 356 states have internal predecessors, (463), 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:52:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:03,379 INFO L93 Difference]: Finished difference Result 531 states and 684 transitions. [2022-02-20 18:52:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 684 transitions. [2022-02-20 18:52:03,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:03,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:03,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.3381502890173411) internal successors, (463), 356 states have internal predecessors, (463), 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 531 states. [2022-02-20 18:52:03,381 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.3381502890173411) internal successors, (463), 356 states have internal predecessors, (463), 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 531 states. [2022-02-20 18:52:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:03,392 INFO L93 Difference]: Finished difference Result 531 states and 684 transitions. [2022-02-20 18:52:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 684 transitions. [2022-02-20 18:52:03,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:03,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:03,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:03,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3381502890173411) internal successors, (463), 356 states have internal predecessors, (463), 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:52:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 463 transitions. [2022-02-20 18:52:03,402 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 463 transitions. Word has length 64 [2022-02-20 18:52:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:03,402 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 463 transitions. [2022-02-20 18:52:03,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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:52:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 463 transitions. [2022-02-20 18:52:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:03,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:03,403 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] [2022-02-20 18:52:03,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:03,404 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash -295025225, now seen corresponding path program 1 times [2022-02-20 18:52:03,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:03,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284392849] [2022-02-20 18:52:03,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:03,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {18465#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {18467#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:03,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {18467#(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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {18468#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {18469#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:03,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {18469#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {18469#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:03,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {18469#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode3~0 % 256; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id4~0 >= 0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~st4~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send4~0 == ~id4~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode4~0 % 256; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id2~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id3~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id4~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id3~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id4~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~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;main_~main__i2~0#1 := 0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send1~0 != ~nomsg~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~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; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send2~0 != ~nomsg~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~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; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send3~0 != ~nomsg~0; {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:03,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {18470#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~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; {18471#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {18471#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {18471#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {18471#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {18471#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {18471#(not (= ~p3_new~0 ~nomsg~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;~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;havoc main_~check__tmp~0#1; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,553 INFO L290 TraceCheckUtils]: 55: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~1#1 > ~id3~0); {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {18472#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:03,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {18472#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18473#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~1#1|))} is VALID [2022-02-20 18:52:03,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {18473#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~1#1|))} assume !(main_~node4__m4~1#1 != ~nomsg~0);~mode4~0 := 0; {18466#false} is VALID [2022-02-20 18:52:03,554 INFO L290 TraceCheckUtils]: 59: Hoare triple {18466#false} ~__tmp_2379_0~0 := main_~main____CPAchecker_TMP_0~0#1; {18466#false} is VALID [2022-02-20 18:52:03,554 INFO L290 TraceCheckUtils]: 60: Hoare triple {18466#false} main_~main____CPAchecker_TMP_0~2#1 := ~__tmp_2379_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;havoc main_~check__tmp~5#1; {18466#false} is VALID [2022-02-20 18:52:03,554 INFO L290 TraceCheckUtils]: 61: Hoare triple {18466#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2394~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2394~0;~__tmp_1738_0~0 := main_~main____CPAchecker_TMP_0~2#1; {18466#false} is VALID [2022-02-20 18:52:03,554 INFO L290 TraceCheckUtils]: 62: Hoare triple {18466#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1738_0~0;havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~13#1;main_~assert__arg~13#1 := main_~__tmp_14~0#1; {18466#false} is VALID [2022-02-20 18:52:03,555 INFO L290 TraceCheckUtils]: 63: Hoare triple {18466#false} assume 0 == main_~assert__arg~13#1 % 256; {18466#false} is VALID [2022-02-20 18:52:03,555 INFO L290 TraceCheckUtils]: 64: Hoare triple {18466#false} assume !false; {18466#false} is VALID [2022-02-20 18:52:03,555 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:52:03,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:03,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284392849] [2022-02-20 18:52:03,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284392849] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:03,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:03,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:03,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495168915] [2022-02-20 18:52:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:03,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 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 65 [2022-02-20 18:52:03,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:03,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 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:52:03,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:03,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:03,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:03,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:03,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:03,604 INFO L87 Difference]: Start difference. First operand 357 states and 463 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 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:52:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,705 INFO L93 Difference]: Finished difference Result 883 states and 1207 transitions. [2022-02-20 18:52:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 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 65 [2022-02-20 18:52:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 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:52:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 732 transitions. [2022-02-20 18:52:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 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:52:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 732 transitions. [2022-02-20 18:52:07,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 732 transitions. [2022-02-20 18:52:08,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 732 edges. 732 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:08,271 INFO L225 Difference]: With dead ends: 883 [2022-02-20 18:52:08,271 INFO L226 Difference]: Without dead ends: 774 [2022-02-20 18:52:08,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:08,273 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 1908 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:08,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1908 Valid, 985 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-02-20 18:52:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 357. [2022-02-20 18:52:09,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:09,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 356 states have internal predecessors, (462), 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:52:09,145 INFO L74 IsIncluded]: Start isIncluded. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 356 states have internal predecessors, (462), 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:52:09,146 INFO L87 Difference]: Start difference. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 356 states have internal predecessors, (462), 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:52:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,189 INFO L93 Difference]: Finished difference Result 774 states and 1045 transitions. [2022-02-20 18:52:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1045 transitions. [2022-02-20 18:52:09,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 356 states have internal predecessors, (462), 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 774 states. [2022-02-20 18:52:09,194 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 356 states have internal predecessors, (462), 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 774 states. [2022-02-20 18:52:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,247 INFO L93 Difference]: Finished difference Result 774 states and 1045 transitions. [2022-02-20 18:52:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1045 transitions. [2022-02-20 18:52:09,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:09,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3352601156069364) internal successors, (462), 356 states have internal predecessors, (462), 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:52:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 462 transitions. [2022-02-20 18:52:09,255 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 462 transitions. Word has length 65 [2022-02-20 18:52:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:09,255 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 462 transitions. [2022-02-20 18:52:09,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 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:52:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 462 transitions. [2022-02-20 18:52:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:09,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:09,260 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] [2022-02-20 18:52:09,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:09,260 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash -168692467, now seen corresponding path program 1 times [2022-02-20 18:52:09,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:09,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106573353] [2022-02-20 18:52:09,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:09,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:09,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {21708#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {21710#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:09,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {21710#(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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {21711#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {21712#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {21712#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {21712#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {21712#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {21713#(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;main_~main__i2~0#1 := 0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {21713#(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; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {21713#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:09,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {21713#(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; {21714#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:09,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {21714#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21714#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:09,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {21714#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {21714#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:09,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {21714#(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; {21714#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:09,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {21714#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {21714#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:09,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {21714#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {21714#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:09,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {21714#(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;~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;havoc main_~check__tmp~0#1; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} ~__tmp_2410_0~0 := main_~main____CPAchecker_TMP_0~0#1; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2410_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {21715#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:09,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {21715#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21716#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} is VALID [2022-02-20 18:52:09,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {21716#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} assume !(main_~node3__m3~2#1 != ~nomsg~0);~mode3~0 := 0; {21709#false} is VALID [2022-02-20 18:52:09,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {21709#false} ~__tmp_2001_0~0 := main_~main____CPAchecker_TMP_0~1#1; {21709#false} is VALID [2022-02-20 18:52:09,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {21709#false} main_~main____CPAchecker_TMP_0~5#1 := ~__tmp_2001_0~0;havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {21709#false} is VALID [2022-02-20 18:52:09,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {21709#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21709#false} is VALID [2022-02-20 18:52:09,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {21709#false} assume main_~node4__m4~8#1 != ~nomsg~0; {21709#false} is VALID [2022-02-20 18:52:09,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {21709#false} assume !(main_~node4__m4~8#1 > ~id4~0); {21709#false} is VALID [2022-02-20 18:52:09,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {21709#false} assume main_~node4__m4~8#1 == ~id4~0;~st4~0 := 1;~mode4~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;havoc main_~check__tmp~11#1; {21709#false} is VALID [2022-02-20 18:52:09,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {21709#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_2045~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_2045~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; {21709#false} is VALID [2022-02-20 18:52:09,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {21709#false} assume 0 == main_~assert__arg~7#1 % 256; {21709#false} is VALID [2022-02-20 18:52:09,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {21709#false} assume !false; {21709#false} is VALID [2022-02-20 18:52:09,409 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:52:09,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:09,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106573353] [2022-02-20 18:52:09,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106573353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:09,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:09,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:09,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495629685] [2022-02-20 18:52:09,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:09,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:09,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:09,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:09,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:09,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:09,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:09,448 INFO L87 Difference]: Start difference. First operand 357 states and 462 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:13,100 INFO L93 Difference]: Finished difference Result 814 states and 1101 transitions. [2022-02-20 18:52:13,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:13,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 684 transitions. [2022-02-20 18:52:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 684 transitions. [2022-02-20 18:52:13,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 684 transitions. [2022-02-20 18:52:13,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 684 edges. 684 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:13,546 INFO L225 Difference]: With dead ends: 814 [2022-02-20 18:52:13,546 INFO L226 Difference]: Without dead ends: 795 [2022-02-20 18:52:13,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:13,549 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 1857 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:13,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1857 Valid, 1103 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-02-20 18:52:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 357. [2022-02-20 18:52:14,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:14,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 357 states, 346 states have (on average 1.329479768786127) internal successors, (460), 356 states have internal predecessors, (460), 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:52:14,230 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 357 states, 346 states have (on average 1.329479768786127) internal successors, (460), 356 states have internal predecessors, (460), 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:52:14,230 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 357 states, 346 states have (on average 1.329479768786127) internal successors, (460), 356 states have internal predecessors, (460), 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:52:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:14,250 INFO L93 Difference]: Finished difference Result 795 states and 1079 transitions. [2022-02-20 18:52:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1079 transitions. [2022-02-20 18:52:14,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:14,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:14,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.329479768786127) internal successors, (460), 356 states have internal predecessors, (460), 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 795 states. [2022-02-20 18:52:14,252 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.329479768786127) internal successors, (460), 356 states have internal predecessors, (460), 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 795 states. [2022-02-20 18:52:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:14,274 INFO L93 Difference]: Finished difference Result 795 states and 1079 transitions. [2022-02-20 18:52:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1079 transitions. [2022-02-20 18:52:14,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:14,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:14,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:14,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.329479768786127) internal successors, (460), 356 states have internal predecessors, (460), 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:52:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 460 transitions. [2022-02-20 18:52:14,281 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 460 transitions. Word has length 66 [2022-02-20 18:52:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:14,281 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 460 transitions. [2022-02-20 18:52:14,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 460 transitions. [2022-02-20 18:52:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:14,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:14,282 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] [2022-02-20 18:52:14,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:14,283 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1424145869, now seen corresponding path program 1 times [2022-02-20 18:52:14,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:14,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161961919] [2022-02-20 18:52:14,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:14,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {24886#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {24888#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:14,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {24888#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {24889#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {24890#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {24890#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {24890#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:14,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {24890#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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;main_~main__i2~0#1 := 0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:14,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {24891#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~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; {24892#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {24892#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {24892#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {24892#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {24892#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {24892#(not (= ~p3_new~0 ~nomsg~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;~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;havoc main_~check__tmp~0#1; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} ~mode1~0 := 0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} ~__tmp_2410_0~0 := main_~main____CPAchecker_TMP_0~0#1; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2410_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~2#1 != ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~2#1 > ~id3~0); {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~2#1;main_~node4__m4~2#1 := ~nomsg~0; {24893#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:14,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {24893#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~2#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {24894#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~2#1|))} is VALID [2022-02-20 18:52:14,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {24894#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~2#1|))} assume !(main_~node4__m4~2#1 != ~nomsg~0);~mode4~0 := 0; {24887#false} is VALID [2022-02-20 18:52:14,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {24887#false} ~__tmp_2255_0~0 := main_~main____CPAchecker_TMP_0~1#1; {24887#false} is VALID [2022-02-20 18:52:14,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {24887#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2255_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;havoc main_~check__tmp~7#1; {24887#false} is VALID [2022-02-20 18:52:14,402 INFO L290 TraceCheckUtils]: 63: Hoare triple {24887#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_2270~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_2270~0;havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~4#1;main_~assert__arg~4#1 := main_~__tmp_5~0#1; {24887#false} is VALID [2022-02-20 18:52:14,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {24887#false} assume 0 == main_~assert__arg~4#1 % 256; {24887#false} is VALID [2022-02-20 18:52:14,402 INFO L290 TraceCheckUtils]: 65: Hoare triple {24887#false} assume !false; {24887#false} is VALID [2022-02-20 18:52:14,403 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:52:14,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:14,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161961919] [2022-02-20 18:52:14,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161961919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:14,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:14,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:14,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829394315] [2022-02-20 18:52:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:14,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:14,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:14,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:14,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:14,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:14,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:14,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:14,448 INFO L87 Difference]: Start difference. First operand 357 states and 460 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:17,713 INFO L93 Difference]: Finished difference Result 780 states and 1048 transitions. [2022-02-20 18:52:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 652 transitions. [2022-02-20 18:52:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 652 transitions. [2022-02-20 18:52:17,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 652 transitions. [2022-02-20 18:52:18,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 652 edges. 652 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:18,055 INFO L225 Difference]: With dead ends: 780 [2022-02-20 18:52:18,056 INFO L226 Difference]: Without dead ends: 774 [2022-02-20 18:52:18,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:18,058 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 1809 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:18,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1809 Valid, 1061 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-02-20 18:52:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 357. [2022-02-20 18:52:18,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:18,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.323699421965318) internal successors, (458), 356 states have internal predecessors, (458), 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:52:18,978 INFO L74 IsIncluded]: Start isIncluded. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.323699421965318) internal successors, (458), 356 states have internal predecessors, (458), 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:52:18,978 INFO L87 Difference]: Start difference. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.323699421965318) internal successors, (458), 356 states have internal predecessors, (458), 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:52:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,999 INFO L93 Difference]: Finished difference Result 774 states and 1041 transitions. [2022-02-20 18:52:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1041 transitions. [2022-02-20 18:52:18,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:19,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:19,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.323699421965318) internal successors, (458), 356 states have internal predecessors, (458), 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 774 states. [2022-02-20 18:52:19,000 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.323699421965318) internal successors, (458), 356 states have internal predecessors, (458), 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 774 states. [2022-02-20 18:52:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,020 INFO L93 Difference]: Finished difference Result 774 states and 1041 transitions. [2022-02-20 18:52:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1041 transitions. [2022-02-20 18:52:19,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:19,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:19,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:19,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:19,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.323699421965318) internal successors, (458), 356 states have internal predecessors, (458), 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:52:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 458 transitions. [2022-02-20 18:52:19,027 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 458 transitions. Word has length 66 [2022-02-20 18:52:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:19,028 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 458 transitions. [2022-02-20 18:52:19,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 458 transitions. [2022-02-20 18:52:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:19,028 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:19,029 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] [2022-02-20 18:52:19,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:19,029 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:19,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash -155488627, now seen corresponding path program 1 times [2022-02-20 18:52:19,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:19,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207455673] [2022-02-20 18:52:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:19,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {27980#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {27982#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:19,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {27982#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {27983#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:19,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {27983#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {27983#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:19,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {27983#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {27984#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:19,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {27984#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {27984#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:19,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {27984#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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;main_~main__i2~0#1 := 0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:19,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {27985#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~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; {27986#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:19,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {27986#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {27986#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:19,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {27986#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {27986#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:19,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {27986#(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; {27986#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:19,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {27986#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {27986#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:19,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {27986#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {27986#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:19,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {27986#(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; {27986#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:19,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {27986#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {27986#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:19,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {27986#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {27986#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:19,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {27986#(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;~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;havoc main_~check__tmp~0#1; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 4); {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} ~__tmp_2410_0~0 := main_~main____CPAchecker_TMP_0~0#1; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2410_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {27987#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:19,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {27987#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {27988#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} is VALID [2022-02-20 18:52:19,151 INFO L290 TraceCheckUtils]: 52: Hoare triple {27988#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} assume !(main_~node2__m2~2#1 != ~nomsg~0);~mode2~0 := 0; {27981#false} is VALID [2022-02-20 18:52:19,151 INFO L290 TraceCheckUtils]: 53: Hoare triple {27981#false} ~__tmp_1537_0~0 := main_~main____CPAchecker_TMP_0~1#1; {27981#false} is VALID [2022-02-20 18:52:19,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {27981#false} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_1537_0~0;havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {27981#false} is VALID [2022-02-20 18:52:19,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {27981#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {27981#false} is VALID [2022-02-20 18:52:19,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {27981#false} assume main_~node3__m3~12#1 != ~nomsg~0; {27981#false} is VALID [2022-02-20 18:52:19,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {27981#false} assume !(main_~node3__m3~12#1 > ~id3~0); {27981#false} is VALID [2022-02-20 18:52:19,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {27981#false} assume main_~node3__m3~12#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~14#1;main_~node4__m4~14#1 := ~nomsg~0; {27981#false} is VALID [2022-02-20 18:52:19,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {27981#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~14#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {27981#false} is VALID [2022-02-20 18:52:19,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {27981#false} assume main_~node4__m4~14#1 != ~nomsg~0; {27981#false} is VALID [2022-02-20 18:52:19,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {27981#false} assume !(main_~node4__m4~14#1 > ~id4~0); {27981#false} is VALID [2022-02-20 18:52:19,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {27981#false} assume main_~node4__m4~14#1 == ~id4~0;~st4~0 := 1;~mode4~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;havoc main_~check__tmp~19#1; {27981#false} is VALID [2022-02-20 18:52:19,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {27981#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~19#1 := 0;~__return_1610~0 := main_~check__tmp~19#1;main_~main__c1~0#1 := ~__return_1610~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; {27981#false} is VALID [2022-02-20 18:52:19,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {27981#false} assume 0 == main_~assert__arg~15#1 % 256; {27981#false} is VALID [2022-02-20 18:52:19,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {27981#false} assume !false; {27981#false} is VALID [2022-02-20 18:52:19,153 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:52:19,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:19,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207455673] [2022-02-20 18:52:19,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207455673] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:19,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:19,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:19,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220579132] [2022-02-20 18:52:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:19,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:19,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:19,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:19,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:19,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:19,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:19,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:19,192 INFO L87 Difference]: Start difference. First operand 357 states and 458 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:21,367 INFO L93 Difference]: Finished difference Result 701 states and 948 transitions. [2022-02-20 18:52:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:52:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 614 transitions. [2022-02-20 18:52:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 614 transitions. [2022-02-20 18:52:21,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 614 transitions. [2022-02-20 18:52:21,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:21,645 INFO L225 Difference]: With dead ends: 701 [2022-02-20 18:52:21,645 INFO L226 Difference]: Without dead ends: 524 [2022-02-20 18:52:21,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:52:21,646 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 1348 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:21,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1348 Valid, 909 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-02-20 18:52:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 357. [2022-02-20 18:52:22,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:22,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 524 states. Second operand has 357 states, 346 states have (on average 1.3179190751445087) internal successors, (456), 356 states have internal predecessors, (456), 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:52:22,344 INFO L74 IsIncluded]: Start isIncluded. First operand 524 states. Second operand has 357 states, 346 states have (on average 1.3179190751445087) internal successors, (456), 356 states have internal predecessors, (456), 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:52:22,345 INFO L87 Difference]: Start difference. First operand 524 states. Second operand has 357 states, 346 states have (on average 1.3179190751445087) internal successors, (456), 356 states have internal predecessors, (456), 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:52:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,354 INFO L93 Difference]: Finished difference Result 524 states and 700 transitions. [2022-02-20 18:52:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 700 transitions. [2022-02-20 18:52:22,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.3179190751445087) internal successors, (456), 356 states have internal predecessors, (456), 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 524 states. [2022-02-20 18:52:22,355 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.3179190751445087) internal successors, (456), 356 states have internal predecessors, (456), 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 524 states. [2022-02-20 18:52:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,365 INFO L93 Difference]: Finished difference Result 524 states and 700 transitions. [2022-02-20 18:52:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 700 transitions. [2022-02-20 18:52:22,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:22,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3179190751445087) internal successors, (456), 356 states have internal predecessors, (456), 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:52:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 456 transitions. [2022-02-20 18:52:22,371 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 456 transitions. Word has length 66 [2022-02-20 18:52:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:22,372 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 456 transitions. [2022-02-20 18:52:22,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 456 transitions. [2022-02-20 18:52:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:22,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:22,373 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] [2022-02-20 18:52:22,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:22,373 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:22,373 INFO L85 PathProgramCache]: Analyzing trace with hash -131812051, now seen corresponding path program 1 times [2022-02-20 18:52:22,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:22,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840050479] [2022-02-20 18:52:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:22,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:22,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {30455#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {30457#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {30457#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {30458#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {30459#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {30459#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {30459#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:22,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {30459#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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;main_~main__i2~0#1 := 0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:22,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {30460#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~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; {30461#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {30461#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {30461#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {30461#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {30461#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {30461#(not (= ~p3_new~0 ~nomsg~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;~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;havoc main_~check__tmp~0#1; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,493 INFO L290 TraceCheckUtils]: 52: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} ~mode2~0 := 0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} ~__tmp_1664_0~0 := main_~main____CPAchecker_TMP_0~0#1; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1664_0~0;havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~11#1 != ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~11#1 > ~id3~0); {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~11#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~13#1;main_~node4__m4~13#1 := ~nomsg~0; {30462#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:22,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {30462#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~13#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {30463#(not (= |ULTIMATE.start_main_~node4__m4~13#1| ~nomsg~0))} is VALID [2022-02-20 18:52:22,496 INFO L290 TraceCheckUtils]: 60: Hoare triple {30463#(not (= |ULTIMATE.start_main_~node4__m4~13#1| ~nomsg~0))} assume !(main_~node4__m4~13#1 != ~nomsg~0);~mode4~0 := 0; {30456#false} is VALID [2022-02-20 18:52:22,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {30456#false} ~__tmp_1486_0~0 := main_~main____CPAchecker_TMP_0~8#1; {30456#false} is VALID [2022-02-20 18:52:22,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {30456#false} main_~main____CPAchecker_TMP_0~10#1 := ~__tmp_1486_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;havoc main_~check__tmp~21#1; {30456#false} is VALID [2022-02-20 18:52:22,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {30456#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~21#1 := 0;~__return_1501~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_1501~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; {30456#false} is VALID [2022-02-20 18:52:22,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {30456#false} assume 0 == main_~assert__arg~17#1 % 256; {30456#false} is VALID [2022-02-20 18:52:22,496 INFO L290 TraceCheckUtils]: 65: Hoare triple {30456#false} assume !false; {30456#false} is VALID [2022-02-20 18:52:22,497 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:52:22,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:22,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840050479] [2022-02-20 18:52:22,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840050479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:22,497 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:22,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:22,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279080931] [2022-02-20 18:52:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:22,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:22,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:22,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:22,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:22,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:22,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:22,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:22,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:22,536 INFO L87 Difference]: Start difference. First operand 357 states and 456 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:25,482 INFO L93 Difference]: Finished difference Result 886 states and 1203 transitions. [2022-02-20 18:52:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:25,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 731 transitions. [2022-02-20 18:52:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 731 transitions. [2022-02-20 18:52:25,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 731 transitions. [2022-02-20 18:52:25,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:25,828 INFO L225 Difference]: With dead ends: 886 [2022-02-20 18:52:25,828 INFO L226 Difference]: Without dead ends: 774 [2022-02-20 18:52:25,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:25,829 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 965 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:25,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [965 Valid, 1072 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-02-20 18:52:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 357. [2022-02-20 18:52:26,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:26,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.3150289017341041) internal successors, (455), 356 states have internal predecessors, (455), 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:52:26,635 INFO L74 IsIncluded]: Start isIncluded. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.3150289017341041) internal successors, (455), 356 states have internal predecessors, (455), 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:52:26,635 INFO L87 Difference]: Start difference. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.3150289017341041) internal successors, (455), 356 states have internal predecessors, (455), 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:52:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,665 INFO L93 Difference]: Finished difference Result 774 states and 1038 transitions. [2022-02-20 18:52:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1038 transitions. [2022-02-20 18:52:26,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.3150289017341041) internal successors, (455), 356 states have internal predecessors, (455), 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 774 states. [2022-02-20 18:52:26,667 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.3150289017341041) internal successors, (455), 356 states have internal predecessors, (455), 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 774 states. [2022-02-20 18:52:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,687 INFO L93 Difference]: Finished difference Result 774 states and 1038 transitions. [2022-02-20 18:52:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1038 transitions. [2022-02-20 18:52:26,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:26,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3150289017341041) internal successors, (455), 356 states have internal predecessors, (455), 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:52:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 455 transitions. [2022-02-20 18:52:26,695 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 455 transitions. Word has length 66 [2022-02-20 18:52:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:26,695 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 455 transitions. [2022-02-20 18:52:26,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 455 transitions. [2022-02-20 18:52:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:26,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:26,696 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] [2022-02-20 18:52:26,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:52:26,696 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2058619373, now seen corresponding path program 1 times [2022-02-20 18:52:26,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:26,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856457462] [2022-02-20 18:52:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:26,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {33699#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {33701#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:26,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {33701#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {33702#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {33703#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {33703#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st2~0; {33703#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {33703#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~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;main_~main__i2~0#1 := 0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~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; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {33704#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~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; {33705#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {33705#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {33705#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {33705#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {33705#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {33705#(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; {33705#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {33705#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {33705#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {33705#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {33705#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {33705#(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;~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;havoc main_~check__tmp~0#1; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} ~__tmp_1664_0~0 := main_~main____CPAchecker_TMP_0~0#1; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1664_0~0;havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {33706#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {33706#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {33707#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~11#1|))} is VALID [2022-02-20 18:52:26,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {33707#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~11#1|))} assume !(main_~node3__m3~11#1 != ~nomsg~0);~mode3~0 := 0; {33700#false} is VALID [2022-02-20 18:52:26,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {33700#false} ~__tmp_1252_0~0 := main_~main____CPAchecker_TMP_0~8#1; {33700#false} is VALID [2022-02-20 18:52:26,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {33700#false} main_~main____CPAchecker_TMP_0~12#1 := ~__tmp_1252_0~0;havoc main_~node4__m4~19#1;main_~node4__m4~19#1 := ~nomsg~0; {33700#false} is VALID [2022-02-20 18:52:26,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {33700#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~19#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {33700#false} is VALID [2022-02-20 18:52:26,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {33700#false} assume main_~node4__m4~19#1 != ~nomsg~0; {33700#false} is VALID [2022-02-20 18:52:26,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {33700#false} assume !(main_~node4__m4~19#1 > ~id4~0); {33700#false} is VALID [2022-02-20 18:52:26,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {33700#false} assume main_~node4__m4~19#1 == ~id4~0;~st4~0 := 1;~mode4~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;havoc main_~check__tmp~25#1; {33700#false} is VALID [2022-02-20 18:52:26,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {33700#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~25#1 := 0;~__return_1296~0 := main_~check__tmp~25#1;main_~main__c1~0#1 := ~__return_1296~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; {33700#false} is VALID [2022-02-20 18:52:26,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {33700#false} assume 0 == main_~assert__arg~21#1 % 256; {33700#false} is VALID [2022-02-20 18:52:26,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {33700#false} assume !false; {33700#false} is VALID [2022-02-20 18:52:26,812 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:52:26,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:26,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856457462] [2022-02-20 18:52:26,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856457462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:26,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:26,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:26,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389198041] [2022-02-20 18:52:26,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:26,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:26,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:26,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:26,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:26,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:26,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:26,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:26,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:26,860 INFO L87 Difference]: Start difference. First operand 357 states and 455 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,237 INFO L93 Difference]: Finished difference Result 920 states and 1252 transitions. [2022-02-20 18:52:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 760 transitions. [2022-02-20 18:52:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 760 transitions. [2022-02-20 18:52:30,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 760 transitions. [2022-02-20 18:52:30,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 760 edges. 760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:30,605 INFO L225 Difference]: With dead ends: 920 [2022-02-20 18:52:30,606 INFO L226 Difference]: Without dead ends: 795 [2022-02-20 18:52:30,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:30,607 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1386 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:30,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1386 Valid, 1297 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-02-20 18:52:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 357. [2022-02-20 18:52:31,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:31,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 357 states, 346 states have (on average 1.3121387283236994) internal successors, (454), 356 states have internal predecessors, (454), 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:52:31,313 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 357 states, 346 states have (on average 1.3121387283236994) internal successors, (454), 356 states have internal predecessors, (454), 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:52:31,313 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 357 states, 346 states have (on average 1.3121387283236994) internal successors, (454), 356 states have internal predecessors, (454), 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:52:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,334 INFO L93 Difference]: Finished difference Result 795 states and 1071 transitions. [2022-02-20 18:52:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1071 transitions. [2022-02-20 18:52:31,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.3121387283236994) internal successors, (454), 356 states have internal predecessors, (454), 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 795 states. [2022-02-20 18:52:31,335 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.3121387283236994) internal successors, (454), 356 states have internal predecessors, (454), 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 795 states. [2022-02-20 18:52:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,357 INFO L93 Difference]: Finished difference Result 795 states and 1071 transitions. [2022-02-20 18:52:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1071 transitions. [2022-02-20 18:52:31,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:31,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3121387283236994) internal successors, (454), 356 states have internal predecessors, (454), 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:52:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 454 transitions. [2022-02-20 18:52:31,364 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 454 transitions. Word has length 66 [2022-02-20 18:52:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:31,364 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 454 transitions. [2022-02-20 18:52:31,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 454 transitions. [2022-02-20 18:52:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:31,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:31,365 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] [2022-02-20 18:52:31,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:52:31,365 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1833305997, now seen corresponding path program 1 times [2022-02-20 18:52:31,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:31,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78984009] [2022-02-20 18:52:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:31,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {37025#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {37027#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {37027#(<= (+ ~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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {37028#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {37029#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {37029#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {37029#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {37029#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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;main_~main__i2~0#1 := 0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~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; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {37030#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~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; {37031#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {37031#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {37031#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {37031#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {37031#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {37031#(not (= ~p3_new~0 ~nomsg~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;~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;havoc main_~check__tmp~0#1; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,478 INFO L290 TraceCheckUtils]: 44: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,478 INFO L290 TraceCheckUtils]: 45: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} ~mode3~0 := 0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,481 INFO L290 TraceCheckUtils]: 57: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} ~__tmp_2125_0~0 := main_~main____CPAchecker_TMP_0~0#1; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,481 INFO L290 TraceCheckUtils]: 58: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_2125_0~0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {37032#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {37032#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {37033#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} is VALID [2022-02-20 18:52:31,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {37033#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {37026#false} is VALID [2022-02-20 18:52:31,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {37026#false} ~__tmp_1924_0~0 := main_~main____CPAchecker_TMP_0~4#1; {37026#false} is VALID [2022-02-20 18:52:31,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {37026#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_1924_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;havoc main_~check__tmp~13#1; {37026#false} is VALID [2022-02-20 18:52:31,482 INFO L290 TraceCheckUtils]: 63: Hoare triple {37026#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~13#1 := 0;~__return_1939~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_1939~0;havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~9#1;main_~assert__arg~9#1 := main_~__tmp_10~0#1; {37026#false} is VALID [2022-02-20 18:52:31,482 INFO L290 TraceCheckUtils]: 64: Hoare triple {37026#false} assume 0 == main_~assert__arg~9#1 % 256; {37026#false} is VALID [2022-02-20 18:52:31,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {37026#false} assume !false; {37026#false} is VALID [2022-02-20 18:52:31,483 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:52:31,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:31,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78984009] [2022-02-20 18:52:31,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78984009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:31,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:31,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:31,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896648225] [2022-02-20 18:52:31,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:31,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:31,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:31,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:31,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:31,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:31,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:31,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:31,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:31,522 INFO L87 Difference]: Start difference. First operand 357 states and 454 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:35,018 INFO L93 Difference]: Finished difference Result 780 states and 1042 transitions. [2022-02-20 18:52:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:35,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2022-02-20 18:52:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 648 transitions. [2022-02-20 18:52:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 648 transitions. [2022-02-20 18:52:35,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 648 transitions. [2022-02-20 18:52:35,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 648 edges. 648 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:35,336 INFO L225 Difference]: With dead ends: 780 [2022-02-20 18:52:35,336 INFO L226 Difference]: Without dead ends: 774 [2022-02-20 18:52:35,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:35,337 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1404 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:35,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1404 Valid, 1201 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-02-20 18:52:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 357. [2022-02-20 18:52:36,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:36,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.3092485549132948) internal successors, (453), 356 states have internal predecessors, (453), 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:52:36,096 INFO L74 IsIncluded]: Start isIncluded. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.3092485549132948) internal successors, (453), 356 states have internal predecessors, (453), 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:52:36,096 INFO L87 Difference]: Start difference. First operand 774 states. Second operand has 357 states, 346 states have (on average 1.3092485549132948) internal successors, (453), 356 states have internal predecessors, (453), 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:52:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,117 INFO L93 Difference]: Finished difference Result 774 states and 1035 transitions. [2022-02-20 18:52:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1035 transitions. [2022-02-20 18:52:36,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 346 states have (on average 1.3092485549132948) internal successors, (453), 356 states have internal predecessors, (453), 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 774 states. [2022-02-20 18:52:36,119 INFO L87 Difference]: Start difference. First operand has 357 states, 346 states have (on average 1.3092485549132948) internal successors, (453), 356 states have internal predecessors, (453), 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 774 states. [2022-02-20 18:52:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,140 INFO L93 Difference]: Finished difference Result 774 states and 1035 transitions. [2022-02-20 18:52:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1035 transitions. [2022-02-20 18:52:36,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:36,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 346 states have (on average 1.3092485549132948) internal successors, (453), 356 states have internal predecessors, (453), 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:52:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 453 transitions. [2022-02-20 18:52:36,147 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 453 transitions. Word has length 66 [2022-02-20 18:52:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:36,148 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 453 transitions. [2022-02-20 18:52:36,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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:52:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 453 transitions. [2022-02-20 18:52:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:52:36,148 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:36,148 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] [2022-02-20 18:52:36,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:52:36,149 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash 817551922, now seen corresponding path program 1 times [2022-02-20 18:52:36,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:36,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143336574] [2022-02-20 18:52:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:36,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:36,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {40119#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {40119#true} is VALID [2022-02-20 18:52:36,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {40119#true} 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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {40121#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {40122#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {40122#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {40122#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {40122#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {40123#(and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {40123#(and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode2~0 % 256; {40123#(and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {40123#(and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id3~0 >= 0; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~st3~0; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~send3~0 == ~id3~0; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode3~0 % 256; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id4~0 >= 0; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~st4~0; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~send4~0 == ~id4~0; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode4~0 % 256; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id2~0; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id3~0; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id4~0; {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {40124#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id2~0 != ~id3~0; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id2~0 != ~id4~0; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~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;main_~main__i2~0#1 := 0; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~send1~0 != ~nomsg~0; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~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; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~send2~0 != ~nomsg~0; {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:52:36,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {40125#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id3~0 127)) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (or (and (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 ~id2~0)) (not (<= (+ ~id2~0 1) ~id3~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; {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} is VALID [2022-02-20 18:52:36,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} is VALID [2022-02-20 18:52:36,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} assume ~send3~0 != ~nomsg~0; {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} is VALID [2022-02-20 18:52:36,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~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; {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} is VALID [2022-02-20 18:52:36,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} is VALID [2022-02-20 18:52:36,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} assume ~send4~0 != ~nomsg~0; {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~p2_new~0))))} is VALID [2022-02-20 18:52:36,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {40126#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0)))) (or (not (<= (+ ~id2~0 1) ~id3~0)) (<= (+ ~id3~0 129) ~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;~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;havoc main_~check__tmp~0#1; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume !(~r1~0 >= 4); {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,534 INFO L290 TraceCheckUtils]: 43: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume main_~node1__m1~1#1 != ~nomsg~0; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,536 INFO L290 TraceCheckUtils]: 47: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} ~mode1~0 := 0; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} ~__tmp_2410_0~0 := main_~main____CPAchecker_TMP_0~0#1; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2410_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume main_~node2__m2~2#1 != ~nomsg~0; {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume !(main_~node2__m2~2#1 > ~id2~0); {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} is VALID [2022-02-20 18:52:36,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {40127#(or (<= (+ ~p2_old~0 1) ~id3~0) (and (or (<= (+ ~id2~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0)))) (or (<= (+ ~id3~0 129) ~p2_old~0) (not (<= (+ ~id2~0 1) ~id3~0)))))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {40128#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:52:36,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {40128#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {40129#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:52:36,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {40129#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume main_~node3__m3~2#1 != ~nomsg~0; {40129#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:52:36,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {40129#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume !(main_~node3__m3~2#1 > ~id3~0); {40130#(<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0)} is VALID [2022-02-20 18:52:36,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {40130#(<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0)} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~2#1;main_~node4__m4~2#1 := ~nomsg~0; {40120#false} is VALID [2022-02-20 18:52:36,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {40120#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~2#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {40120#false} is VALID [2022-02-20 18:52:36,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {40120#false} assume main_~node4__m4~2#1 != ~nomsg~0; {40120#false} is VALID [2022-02-20 18:52:36,543 INFO L290 TraceCheckUtils]: 61: Hoare triple {40120#false} assume !(main_~node4__m4~2#1 > ~id4~0); {40120#false} is VALID [2022-02-20 18:52:36,543 INFO L290 TraceCheckUtils]: 62: Hoare triple {40120#false} assume main_~node4__m4~2#1 == ~id4~0;~st4~0 := 1;~mode4~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;havoc main_~check__tmp~3#1; {40120#false} is VALID [2022-02-20 18:52:36,543 INFO L290 TraceCheckUtils]: 63: Hoare triple {40120#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~3#1 := 0;~__return_2512~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_2512~0;~__tmp_1738_0~0 := main_~main____CPAchecker_TMP_0~1#1; {40120#false} is VALID [2022-02-20 18:52:36,543 INFO L290 TraceCheckUtils]: 64: Hoare triple {40120#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1738_0~0;havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~13#1;main_~assert__arg~13#1 := main_~__tmp_14~0#1; {40120#false} is VALID [2022-02-20 18:52:36,543 INFO L290 TraceCheckUtils]: 65: Hoare triple {40120#false} assume 0 == main_~assert__arg~13#1 % 256; {40120#false} is VALID [2022-02-20 18:52:36,543 INFO L290 TraceCheckUtils]: 66: Hoare triple {40120#false} assume !false; {40120#false} is VALID [2022-02-20 18:52:36,544 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:52:36,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:36,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143336574] [2022-02-20 18:52:36,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143336574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:36,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:36,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:52:36,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169478843] [2022-02-20 18:52:36,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:36,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 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 67 [2022-02-20 18:52:36,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:36,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 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:52:36,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:36,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:52:36,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:52:36,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:52:36,616 INFO L87 Difference]: Start difference. First operand 357 states and 453 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 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:52:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:41,657 INFO L93 Difference]: Finished difference Result 701 states and 925 transitions. [2022-02-20 18:52:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:52:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 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 67 [2022-02-20 18:52:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 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:52:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 593 transitions. [2022-02-20 18:52:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 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:52:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 593 transitions. [2022-02-20 18:52:41,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 593 transitions. [2022-02-20 18:52:42,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:42,028 INFO L225 Difference]: With dead ends: 701 [2022-02-20 18:52:42,028 INFO L226 Difference]: Without dead ends: 578 [2022-02-20 18:52:42,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:42,031 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 1487 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:42,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1487 Valid, 2246 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-02-20 18:52:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 336. [2022-02-20 18:52:43,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:43,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 578 states. Second operand has 336 states, 326 states have (on average 1.3067484662576687) internal successors, (426), 335 states have internal predecessors, (426), 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:52:43,019 INFO L74 IsIncluded]: Start isIncluded. First operand 578 states. Second operand has 336 states, 326 states have (on average 1.3067484662576687) internal successors, (426), 335 states have internal predecessors, (426), 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:52:43,019 INFO L87 Difference]: Start difference. First operand 578 states. Second operand has 336 states, 326 states have (on average 1.3067484662576687) internal successors, (426), 335 states have internal predecessors, (426), 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:52:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:43,031 INFO L93 Difference]: Finished difference Result 578 states and 745 transitions. [2022-02-20 18:52:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 745 transitions. [2022-02-20 18:52:43,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:43,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:43,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 336 states, 326 states have (on average 1.3067484662576687) internal successors, (426), 335 states have internal predecessors, (426), 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 578 states. [2022-02-20 18:52:43,032 INFO L87 Difference]: Start difference. First operand has 336 states, 326 states have (on average 1.3067484662576687) internal successors, (426), 335 states have internal predecessors, (426), 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 578 states. [2022-02-20 18:52:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:43,043 INFO L93 Difference]: Finished difference Result 578 states and 745 transitions. [2022-02-20 18:52:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 745 transitions. [2022-02-20 18:52:43,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:43,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:43,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:43,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 326 states have (on average 1.3067484662576687) internal successors, (426), 335 states have internal predecessors, (426), 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:52:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 426 transitions. [2022-02-20 18:52:43,072 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 426 transitions. Word has length 67 [2022-02-20 18:52:43,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:43,073 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 426 transitions. [2022-02-20 18:52:43,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 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:52:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 426 transitions. [2022-02-20 18:52:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:52:43,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:43,074 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] [2022-02-20 18:52:43,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 18:52:43,074 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:43,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash 167509874, now seen corresponding path program 1 times [2022-02-20 18:52:43,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:43,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044249725] [2022-02-20 18:52:43,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:43,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:43,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {42671#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(50, 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;~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];~__return_120~0 := 0;~__return_800~0 := 0;~__tmp_2641_0~0 := 0;~__return_2669~0 := 0;~__return_786~0 := 0;~__tmp_2410_0~0 := 0;~__return_2512~0 := 0;~__return_772~0 := 0;~__tmp_2379_0~0 := 0;~__return_2394~0 := 0;~__return_758~0 := 0;~__tmp_2185_0~0 := 0;~__tmp_2255_0~0 := 0;~__return_2270~0 := 0;~__return_744~0 := 0;~__tmp_2125_0~0 := 0;~__return_2169~0 := 0;~__return_730~0 := 0;~__tmp_1960_0~0 := 0;~__tmp_2001_0~0 := 0;~__return_2045~0 := 0;~__return_716~0 := 0;~__tmp_1912_0~0 := 0;~__tmp_1924_0~0 := 0;~__return_1939~0 := 0;~__return_702~0 := 0;~__tmp_1761_0~0 := 0;~__tmp_1802_0~0 := 0;~__tmp_1814_0~0 := 0;~__return_1832~0 := 0;~__return_688~0 := 0;~__tmp_1664_0~0 := 0;~__return_1737~0 := 0;~__tmp_1738_0~0 := 0;~__return_674~0 := 0;~__tmp_1525_0~0 := 0;~__tmp_1537_0~0 := 0;~__return_1610~0 := 0;~__return_660~0 := 0;~__tmp_1445_0~0 := 0;~__tmp_1486_0~0 := 0;~__return_1501~0 := 0;~__return_646~0 := 0;~__tmp_1323_0~0 := 0;~__tmp_1335_0~0 := 0;~__tmp_1376_0~0 := 0;~__return_1394~0 := 0;~__return_632~0 := 0;~__tmp_1240_0~0 := 0;~__tmp_1252_0~0 := 0;~__return_1296~0 := 0;~__tmp_1305_0~0 := 0;~__return_618~0 := 0;~__tmp_1118_0~0 := 0;~__tmp_1130_0~0 := 0;~__tmp_1142_0~0 := 0;~__return_1189~0 := 0;~__return_604~0 := 0;~__tmp_1055_0~0 := 0;~__tmp_1067_0~0 := 0;~__tmp_1079_0~0 := 0;~__return_1097~0 := 0;~__return_590~0 := 0;~__tmp_944_0~0 := 0;~__tmp_956_0~0 := 0;~__tmp_968_0~0 := 0;~__tmp_980_0~0 := 0;~__return_1001~0 := 0;~__tmp_1010_0~0 := 0;~__return_2674~0 := 0; {42671#true} is VALID [2022-02-20 18:52:43,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {42671#true} 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_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;havoc main_~init__tmp~0#1; {42673#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:43,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {42673#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume 0 == ~r1~0; {42673#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:43,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {42673#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume ~id1~0 >= 0; {42674#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:43,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {42674#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume 0 == ~st1~0; {42674#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:43,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {42674#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume ~send1~0 == ~id1~0; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode1~0 % 256; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id2~0 >= 0; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~st2~0; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~send2~0 == ~id2~0; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode2~0 % 256; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id3~0 >= 0; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~st3~0; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~send3~0 == ~id3~0; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode3~0 % 256; {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:43,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {42675#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id4~0 >= 0; {42676#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} is VALID [2022-02-20 18:52:43,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {42676#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} assume 0 == ~st4~0; {42676#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} is VALID [2022-02-20 18:52:43,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {42676#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} assume ~send4~0 == ~id4~0; {42677#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {42677#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume 0 == ~mode4~0 % 256; {42677#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {42677#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id1~0 != ~id2~0; {42677#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {42677#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id1~0 != ~id3~0; {42677#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {42677#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id1~0 != ~id4~0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id2~0 != ~id3~0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id2~0 != ~id4~0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_120~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_120~0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} 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;main_~main__i2~0#1 := 0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~send1~0 != ~nomsg~0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} 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; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~send2~0 != ~nomsg~0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~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; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~send3~0 != ~nomsg~0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} 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; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~send4~0 != ~nomsg~0; {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:43,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {42678#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} 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;~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;havoc main_~check__tmp~0#1; {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:43,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:43,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume !(~r1~0 >= 4); {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:43,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:43,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_800~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_800~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; {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:43,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:43,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:43,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {42679#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {42680#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= (+ ~id1~0 1) ~id4~0) (<= ~id4~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:43,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {42680#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= (+ ~id1~0 1) ~id4~0) (<= ~id4~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} assume main_~node1__m1~1#1 != ~nomsg~0; {42680#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= (+ ~id1~0 1) ~id4~0) (<= ~id4~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:43,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {42680#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= (+ ~id1~0 1) ~id4~0) (<= ~id4~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 > ~id1~0); {42681#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:52:43,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {42681#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {42672#false} is VALID [2022-02-20 18:52:43,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {42672#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {42672#false} is VALID [2022-02-20 18:52:43,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {42672#false} assume main_~node2__m2~1#1 != ~nomsg~0; {42672#false} is VALID [2022-02-20 18:52:43,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {42672#false} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {42672#false} is VALID [2022-02-20 18:52:43,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {42672#false} ~mode2~0 := 0; {42672#false} is VALID [2022-02-20 18:52:43,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {42672#false} ~__tmp_1664_0~0 := main_~main____CPAchecker_TMP_0~0#1; {42672#false} is VALID [2022-02-20 18:52:43,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {42672#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1664_0~0;havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {42672#false} is VALID [2022-02-20 18:52:43,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {42672#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {42672#false} is VALID [2022-02-20 18:52:43,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {42672#false} assume main_~node3__m3~11#1 != ~nomsg~0; {42672#false} is VALID [2022-02-20 18:52:43,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {42672#false} assume !(main_~node3__m3~11#1 > ~id3~0); {42672#false} is VALID [2022-02-20 18:52:43,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {42672#false} assume main_~node3__m3~11#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~13#1;main_~node4__m4~13#1 := ~nomsg~0; {42672#false} is VALID [2022-02-20 18:52:43,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {42672#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~13#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {42672#false} is VALID [2022-02-20 18:52:43,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {42672#false} assume main_~node4__m4~13#1 != ~nomsg~0; {42672#false} is VALID [2022-02-20 18:52:43,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {42672#false} assume !(main_~node4__m4~13#1 > ~id4~0); {42672#false} is VALID [2022-02-20 18:52:43,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {42672#false} assume main_~node4__m4~13#1 == ~id4~0;~st4~0 := 1;~mode4~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;havoc main_~check__tmp~17#1; {42672#false} is VALID [2022-02-20 18:52:43,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {42672#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~17#1 := 0;~__return_1737~0 := main_~check__tmp~17#1;main_~main__c1~0#1 := ~__return_1737~0;~__tmp_1738_0~0 := main_~main____CPAchecker_TMP_0~8#1; {42672#false} is VALID [2022-02-20 18:52:43,394 INFO L290 TraceCheckUtils]: 64: Hoare triple {42672#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1738_0~0;havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~13#1;main_~assert__arg~13#1 := main_~__tmp_14~0#1; {42672#false} is VALID [2022-02-20 18:52:43,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {42672#false} assume 0 == main_~assert__arg~13#1 % 256; {42672#false} is VALID [2022-02-20 18:52:43,394 INFO L290 TraceCheckUtils]: 66: Hoare triple {42672#false} assume !false; {42672#false} is VALID [2022-02-20 18:52:43,395 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:52:43,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:43,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044249725] [2022-02-20 18:52:43,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044249725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:43,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:43,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:52:43,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218455544] [2022-02-20 18:52:43,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:43,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 67 [2022-02-20 18:52:43,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:43,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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:52:43,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:43,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:52:43,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:43,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:52:43,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:43,448 INFO L87 Difference]: Start difference. First operand 336 states and 426 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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:52:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:47,662 INFO L93 Difference]: Finished difference Result 853 states and 1146 transitions. [2022-02-20 18:52:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:47,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 67 [2022-02-20 18:52:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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:52:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 756 transitions. [2022-02-20 18:52:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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:52:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 756 transitions. [2022-02-20 18:52:47,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 756 transitions.