./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.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.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 5990b1cf211e12a23ca85722a0e539783495fb8504bce43e0d5e789fe089f178 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:52:00,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:52:00,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:52:00,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:52:00,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:52:00,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:52:00,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:52:00,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:52:00,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:52:00,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:52:00,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:52:00,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:52:00,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:52:00,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:52:00,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:52:00,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:52:00,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:52:00,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:52:00,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:52:00,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:52:00,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:52:00,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:52:00,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:52:00,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:52:00,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:52:00,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:52:00,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:52:00,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:52:00,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:52:00,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:52:00,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:52:00,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:52:00,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:52:00,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:52:00,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:52:00,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:52:00,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:52:00,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:52:00,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:52:00,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:52:00,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:52:00,485 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:52:00,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:52:00,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:52:00,509 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:52:00,509 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:52:00,510 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:52:00,510 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:52:00,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:52:00,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:52:00,510 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:52:00,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:52:00,511 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:52:00,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:52:00,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:52:00,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:52:00,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:52:00,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:52:00,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:52:00,512 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:52:00,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:52:00,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:52:00,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:52:00,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:52:00,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:52:00,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:52:00,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:00,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:52:00,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:52:00,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:52:00,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:52:00,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:52:00,515 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:52:00,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:52:00,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:52:00,516 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 -> 5990b1cf211e12a23ca85722a0e539783495fb8504bce43e0d5e789fe089f178 [2022-02-20 18:52:00,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:52:00,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:52:00,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:52:00,746 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:52:00,747 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:52:00,748 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2022-02-20 18:52:00,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ff251ea/f883440e4bac4a1f8a8b28c2ecae988e/FLAG7cf9ddfac [2022-02-20 18:52:01,300 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:52:01,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2022-02-20 18:52:01,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ff251ea/f883440e4bac4a1f8a8b28c2ecae988e/FLAG7cf9ddfac [2022-02-20 18:52:01,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ff251ea/f883440e4bac4a1f8a8b28c2ecae988e [2022-02-20 18:52:01,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:52:01,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:52:01,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:01,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:52:01,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:52:01,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@856718b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01, skipping insertion in model container [2022-02-20 18:52:01,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:52:01,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:52:02,161 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18815,18828] [2022-02-20 18:52:02,184 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25895,25908] [2022-02-20 18:52:02,194 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29420,29433] [2022-02-20 18:52:02,204 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32798,32811] [2022-02-20 18:52:02,216 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36856,36869] [2022-02-20 18:52:02,225 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40310,40323] [2022-02-20 18:52:02,234 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43875,43888] [2022-02-20 18:52:02,242 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47290,47303] [2022-02-20 18:52:02,251 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[50969,50982] [2022-02-20 18:52:02,258 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54551,54564] [2022-02-20 18:52:02,266 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58080,58093] [2022-02-20 18:52:02,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:02,296 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:52:02,335 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18815,18828] [2022-02-20 18:52:02,347 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25895,25908] [2022-02-20 18:52:02,352 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29420,29433] [2022-02-20 18:52:02,367 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32798,32811] [2022-02-20 18:52:02,374 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36856,36869] [2022-02-20 18:52:02,380 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40310,40323] [2022-02-20 18:52:02,387 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43875,43888] [2022-02-20 18:52:02,393 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47290,47303] [2022-02-20 18:52:02,399 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[50969,50982] [2022-02-20 18:52:02,405 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54551,54564] [2022-02-20 18:52:02,411 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58080,58093] [2022-02-20 18:52:02,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:02,437 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:52:02,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02 WrapperNode [2022-02-20 18:52:02,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:02,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:02,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:52:02,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:52:02,443 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:52:02" (1/1) ... [2022-02-20 18:52:02,459 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:52:02" (1/1) ... [2022-02-20 18:52:02,525 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2761 [2022-02-20 18:52:02,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:02,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:52:02,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:52:02,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:52:02,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (1/1) ... [2022-02-20 18:52:02,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (1/1) ... [2022-02-20 18:52:02,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (1/1) ... [2022-02-20 18:52:02,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (1/1) ... [2022-02-20 18:52:02,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (1/1) ... [2022-02-20 18:52:02,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (1/1) ... [2022-02-20 18:52:02,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (1/1) ... [2022-02-20 18:52:02,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:52:02,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:52:02,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:52:02,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:52:02,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (1/1) ... [2022-02-20 18:52:02,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:02,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:52:02,610 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:52:02,616 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:52:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:52:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:52:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:52:02,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:52:02,756 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:52:02,757 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:52:04,043 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:52:04,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:52:04,052 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:52:04,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:04 BoogieIcfgContainer [2022-02-20 18:52:04,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:52:04,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:52:04,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:52:04,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:52:04,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:52:01" (1/3) ... [2022-02-20 18:52:04,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f11969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:04, skipping insertion in model container [2022-02-20 18:52:04,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (2/3) ... [2022-02-20 18:52:04,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f11969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:04, skipping insertion in model container [2022-02-20 18:52:04,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:04" (3/3) ... [2022-02-20 18:52:04,058 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2022-02-20 18:52:04,062 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:52:04,062 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-20 18:52:04,092 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:52:04,096 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:52:04,096 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-20 18:52:04,115 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:52:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:52:04,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:04,125 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:52:04,126 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:52:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:04,129 INFO L85 PathProgramCache]: Analyzing trace with hash 646480323, now seen corresponding path program 1 times [2022-02-20 18:52:04,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:04,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422877505] [2022-02-20 18:52:04,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:04,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:04,395 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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {575#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:04,396 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:52:04,396 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:52:04,397 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:52:04,397 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:52:04,398 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:52:04,398 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:52:04,399 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:52:04,399 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:52:04,399 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:52:04,400 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:52:04,400 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:52:04,401 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:52:04,401 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:52:04,402 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:52:04,402 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:52:04,403 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:52:04,403 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:52:04,404 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:52:04,404 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:52:04,405 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:52:04,405 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:52:04,405 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:52:04,406 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:52:04,406 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:52:04,407 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:52:04,407 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:52:04,408 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:52:04,408 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:52:04,409 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:52:04,409 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:52:04,409 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:52:04,410 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:52:04,410 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:52:04,411 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:52:04,411 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:52:04,412 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:52:04,412 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:52:04,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {574#false} assume !(~r1~0 >= 4); {574#false} is VALID [2022-02-20 18:52:04,413 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:52:04,413 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:52:04,413 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:52:04,413 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:52:04,414 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:52:04,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {574#false} assume !(main_~node1__m1~4#1 != ~nomsg~0);~mode1~0 := 0;~__tmp_2179_0~0 := main_~main____CPAchecker_TMP_0~3#1; {574#false} is VALID [2022-02-20 18:52:04,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {574#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2179_0~0;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {574#false} is VALID [2022-02-20 18:52:04,414 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:52:04,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {574#false} assume main_~node2__m2~4#1 != ~nomsg~0; {574#false} is VALID [2022-02-20 18:52:04,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {574#false} assume !(main_~node2__m2~4#1 > ~id2~0); {574#false} is VALID [2022-02-20 18:52:04,415 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:52:04,415 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:52:04,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {574#false} assume main_~node3__m3~4#1 != ~nomsg~0; {574#false} is VALID [2022-02-20 18:52:04,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {574#false} assume !(main_~node3__m3~4#1 > ~id3~0); {574#false} is VALID [2022-02-20 18:52:04,416 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:52:04,416 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:52:04,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {574#false} assume !(main_~node4__m4~5#1 != ~nomsg~0);~mode4~0 := 0;~__tmp_2249_0~0 := main_~main____CPAchecker_TMP_0~3#1; {574#false} is VALID [2022-02-20 18:52:04,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {574#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2249_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:52:04,417 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_2264~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_2264~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:52:04,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {574#false} assume 0 == main_~assert__arg~4#1 % 256; {574#false} is VALID [2022-02-20 18:52:04,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {574#false} assume !false; {574#false} is VALID [2022-02-20 18:52:04,418 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:04,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:04,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422877505] [2022-02-20 18:52:04,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422877505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:04,420 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:04,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:04,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759236756] [2022-02-20 18:52:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:04,425 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:52:04,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:04,428 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:52:04,476 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:52:04,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:04,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:04,493 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:52:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:05,996 INFO L93 Difference]: Finished difference Result 785 states and 1334 transitions. [2022-02-20 18:52:05,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:05,997 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:52:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:05,999 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:52:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1334 transitions. [2022-02-20 18:52:06,014 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:52:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1334 transitions. [2022-02-20 18:52:06,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1334 transitions. [2022-02-20 18:52:06,938 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:52:06,961 INFO L225 Difference]: With dead ends: 785 [2022-02-20 18:52:06,962 INFO L226 Difference]: Without dead ends: 503 [2022-02-20 18:52:06,965 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:52:06,967 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:52:06,968 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:52:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-20 18:52:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2022-02-20 18:52:07,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:07,148 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:52:07,149 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:52:07,150 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:52:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,163 INFO L93 Difference]: Finished difference Result 503 states and 627 transitions. [2022-02-20 18:52:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 627 transitions. [2022-02-20 18:52:07,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,165 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:52:07,166 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:52:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,193 INFO L93 Difference]: Finished difference Result 503 states and 627 transitions. [2022-02-20 18:52:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 627 transitions. [2022-02-20 18:52:07,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:07,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:07,195 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:52:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 627 transitions. [2022-02-20 18:52:07,210 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 627 transitions. Word has length 60 [2022-02-20 18:52:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:07,210 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 627 transitions. [2022-02-20 18:52:07,210 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:52:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 627 transitions. [2022-02-20 18:52:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:52:07,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:07,212 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:52:07,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:52:07,212 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:52:07,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 221242932, now seen corresponding path program 1 times [2022-02-20 18:52:07,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:07,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382888621] [2022-02-20 18:52:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:07,308 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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {3186#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,308 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:52:07,309 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:52:07,309 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:52:07,309 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:52:07,310 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:52:07,310 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:52:07,310 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:52:07,311 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:52:07,311 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:52:07,311 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:52:07,312 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:52:07,312 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:52:07,312 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:52:07,313 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:52:07,313 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:52:07,313 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:52:07,314 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:52:07,314 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:52:07,314 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:52:07,315 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:52:07,315 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:52:07,315 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:52:07,316 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:52:07,316 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:52:07,316 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:52:07,317 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:52:07,317 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:52:07,317 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:52:07,318 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:52:07,318 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:52:07,318 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:52:07,319 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:52:07,319 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:52:07,319 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:52:07,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {3185#false} assume ~send4~0 != ~nomsg~0; {3185#false} is VALID [2022-02-20 18:52:07,319 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:52:07,319 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:52:07,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {3185#false} assume !(~r1~0 >= 4); {3185#false} is VALID [2022-02-20 18:52:07,320 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:52:07,320 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:52:07,320 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:52:07,320 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:52:07,320 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:52:07,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} assume main_~node1__m1~7#1 != ~nomsg~0; {3185#false} is VALID [2022-02-20 18:52:07,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume !(main_~node1__m1~7#1 > ~id1~0); {3185#false} is VALID [2022-02-20 18:52:07,321 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:52:07,321 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:52:07,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {3185#false} assume main_~node2__m2~7#1 != ~nomsg~0; {3185#false} is VALID [2022-02-20 18:52:07,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {3185#false} assume !(main_~node2__m2~7#1 > ~id2~0); {3185#false} is VALID [2022-02-20 18:52:07,322 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:52:07,322 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:52:07,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {3185#false} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0;~__tmp_1907_0~0 := main_~main____CPAchecker_TMP_0~6#1; {3185#false} is VALID [2022-02-20 18:52:07,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {3185#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_1907_0~0;havoc main_~node4__m4~10#1;main_~node4__m4~10#1 := ~nomsg~0; {3185#false} is VALID [2022-02-20 18:52:07,322 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:52:07,323 INFO L290 TraceCheckUtils]: 55: Hoare triple {3185#false} assume !(main_~node4__m4~10#1 != ~nomsg~0);~mode4~0 := 0;~__tmp_1919_0~0 := main_~main____CPAchecker_TMP_0~6#1; {3185#false} is VALID [2022-02-20 18:52:07,323 INFO L290 TraceCheckUtils]: 56: Hoare triple {3185#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_1919_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:52:07,323 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_1934~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_1934~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:52:07,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {3185#false} assume 0 == main_~assert__arg~9#1 % 256; {3185#false} is VALID [2022-02-20 18:52:07,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-02-20 18:52:07,324 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:07,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:07,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382888621] [2022-02-20 18:52:07,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382888621] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:07,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:07,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:07,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123218480] [2022-02-20 18:52:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:07,326 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:52:07,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:07,326 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:52:07,363 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:52:07,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:07,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:07,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:07,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:07,365 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:52:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:08,233 INFO L93 Difference]: Finished difference Result 637 states and 796 transitions. [2022-02-20 18:52:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:08,234 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:52:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:08,234 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:52:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2022-02-20 18:52:08,249 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:52:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2022-02-20 18:52:08,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 796 transitions. [2022-02-20 18:52:08,768 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:52:08,774 INFO L225 Difference]: With dead ends: 637 [2022-02-20 18:52:08,775 INFO L226 Difference]: Without dead ends: 381 [2022-02-20 18:52:08,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:52:08,780 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:52:08,781 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:52:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-02-20 18:52:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-02-20 18:52:09,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:09,007 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:52:09,008 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:52:09,008 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:52:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,015 INFO L93 Difference]: Finished difference Result 381 states and 476 transitions. [2022-02-20 18:52:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2022-02-20 18:52:09,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,016 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:52:09,017 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:52:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,023 INFO L93 Difference]: Finished difference Result 381 states and 476 transitions. [2022-02-20 18:52:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2022-02-20 18:52:09,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:09,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:09,025 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:52:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2022-02-20 18:52:09,032 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 60 [2022-02-20 18:52:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:09,032 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2022-02-20 18:52:09,032 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:52:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2022-02-20 18:52:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:52:09,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:09,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:52:09,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:52:09,034 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:52:09,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:09,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2147344789, now seen corresponding path program 1 times [2022-02-20 18:52:09,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:09,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557559732] [2022-02-20 18:52:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:09,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:09,115 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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {5231#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:09,116 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:52:09,116 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:52:09,116 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:52:09,117 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:52:09,117 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:52:09,117 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:52:09,118 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:52:09,118 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:52:09,118 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:52:09,119 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:52:09,119 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:52:09,119 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:52:09,120 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:52:09,120 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:52:09,120 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:52:09,133 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:52:09,134 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:52:09,134 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:52:09,134 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:52:09,135 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:52:09,135 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:52:09,135 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:52:09,136 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:52:09,136 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:52:09,136 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:52:09,136 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:52:09,137 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:52:09,137 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:52:09,137 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:52:09,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {5230#false} assume ~send2~0 != ~nomsg~0; {5230#false} is VALID [2022-02-20 18:52:09,138 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:52:09,138 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:52:09,138 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:52:09,138 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:52:09,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {5230#false} assume ~send4~0 != ~nomsg~0; {5230#false} is VALID [2022-02-20 18:52:09,138 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:52:09,138 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:52:09,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {5230#false} assume !(~r1~0 >= 4); {5230#false} is VALID [2022-02-20 18:52:09,138 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:52:09,138 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:52:09,139 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:52:09,139 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:52:09,139 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:52:09,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {5230#false} assume main_~node1__m1~11#1 != ~nomsg~0; {5230#false} is VALID [2022-02-20 18:52:09,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {5230#false} assume !(main_~node1__m1~11#1 > ~id1~0); {5230#false} is VALID [2022-02-20 18:52:09,139 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:52:09,140 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:52:09,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {5230#false} assume !(main_~node2__m2~12#1 != ~nomsg~0);~mode2~0 := 0;~__tmp_1442_0~0 := main_~main____CPAchecker_TMP_0~10#1; {5230#false} is VALID [2022-02-20 18:52:09,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {5230#false} main_~main____CPAchecker_TMP_0~10#1 := ~__tmp_1442_0~0;havoc main_~node3__m3~13#1;main_~node3__m3~13#1 := ~nomsg~0; {5230#false} is VALID [2022-02-20 18:52:09,140 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:52:09,140 INFO L290 TraceCheckUtils]: 51: Hoare triple {5230#false} assume main_~node3__m3~13#1 != ~nomsg~0; {5230#false} is VALID [2022-02-20 18:52:09,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {5230#false} assume !(main_~node3__m3~13#1 > ~id3~0); {5230#false} is VALID [2022-02-20 18:52:09,140 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:52:09,140 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:52:09,140 INFO L290 TraceCheckUtils]: 55: Hoare triple {5230#false} assume !(main_~node4__m4~16#1 != ~nomsg~0);~mode4~0 := 0;~__tmp_1483_0~0 := main_~main____CPAchecker_TMP_0~10#1; {5230#false} is VALID [2022-02-20 18:52:09,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {5230#false} main_~main____CPAchecker_TMP_0~10#1 := ~__tmp_1483_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:52:09,141 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_1498~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_1498~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:52:09,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {5230#false} assume 0 == main_~assert__arg~17#1 % 256; {5230#false} is VALID [2022-02-20 18:52:09,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {5230#false} assume !false; {5230#false} is VALID [2022-02-20 18:52:09,141 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,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:09,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557559732] [2022-02-20 18:52:09,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557559732] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:09,142 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:09,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:09,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233634755] [2022-02-20 18:52:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:09,143 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:52:09,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:09,143 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:52:09,176 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:52:09,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:09,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:09,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:09,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:09,177 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:52:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,905 INFO L93 Difference]: Finished difference Result 539 states and 682 transitions. [2022-02-20 18:52:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:09,905 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:52:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:09,905 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:52:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2022-02-20 18:52:09,908 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:52:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2022-02-20 18:52:09,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 682 transitions. [2022-02-20 18:52:10,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 682 edges. 682 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:10,352 INFO L225 Difference]: With dead ends: 539 [2022-02-20 18:52:10,352 INFO L226 Difference]: Without dead ends: 335 [2022-02-20 18:52:10,352 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:52:10,353 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 1218 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:10,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 240 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-02-20 18:52:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2022-02-20 18:52:10,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:10,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 335 states, 324 states have (on average 1.2993827160493827) internal successors, (421), 334 states have internal predecessors, (421), 0 states have call successors, (0), 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:10,628 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 335 states, 324 states have (on average 1.2993827160493827) internal successors, (421), 334 states have internal predecessors, (421), 0 states have call successors, (0), 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:10,629 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 335 states, 324 states have (on average 1.2993827160493827) internal successors, (421), 334 states have internal predecessors, (421), 0 states have call successors, (0), 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:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:10,634 INFO L93 Difference]: Finished difference Result 335 states and 421 transitions. [2022-02-20 18:52:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 421 transitions. [2022-02-20 18:52:10,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:10,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:10,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 324 states have (on average 1.2993827160493827) internal successors, (421), 334 states have internal predecessors, (421), 0 states have call successors, (0), 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 335 states. [2022-02-20 18:52:10,636 INFO L87 Difference]: Start difference. First operand has 335 states, 324 states have (on average 1.2993827160493827) internal successors, (421), 334 states have internal predecessors, (421), 0 states have call successors, (0), 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 335 states. [2022-02-20 18:52:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:10,640 INFO L93 Difference]: Finished difference Result 335 states and 421 transitions. [2022-02-20 18:52:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 421 transitions. [2022-02-20 18:52:10,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:10,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:10,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:10,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 324 states have (on average 1.2993827160493827) internal successors, (421), 334 states have internal predecessors, (421), 0 states have call successors, (0), 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:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 421 transitions. [2022-02-20 18:52:10,647 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 421 transitions. Word has length 60 [2022-02-20 18:52:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:10,647 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 421 transitions. [2022-02-20 18:52:10,647 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:52:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 421 transitions. [2022-02-20 18:52:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:10,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:10,648 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:52:10,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:52:10,649 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:52:10,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash 604643521, now seen corresponding path program 1 times [2022-02-20 18:52:10,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:10,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035657244] [2022-02-20 18:52:10,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:10,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {7016#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {7018#(<= (+ ~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; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {7018#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {7018#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {7019#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:10,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {7019#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {7019#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:10,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {7019#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {7020#(<= (+ ~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; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {7020#(<= (+ ~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; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {7020#(<= (+ ~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; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {7020#(<= (+ ~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; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {7020#(<= (+ ~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; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {7020#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7020#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:10,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {7020#(<= (+ ~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; {7017#false} is VALID [2022-02-20 18:52:10,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {7017#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~1#1; {7017#false} is VALID [2022-02-20 18:52:10,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {7017#false} assume ~send4~0 != ~nomsg~0; {7017#false} is VALID [2022-02-20 18:52:10,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {7017#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; {7017#false} is VALID [2022-02-20 18:52:10,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {7017#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {7017#false} is VALID [2022-02-20 18:52:10,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {7017#false} assume !(~r1~0 >= 4); {7017#false} is VALID [2022-02-20 18:52:10,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {7017#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {7017#false} is VALID [2022-02-20 18:52:10,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {7017#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; {7017#false} is VALID [2022-02-20 18:52:10,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {7017#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; {7017#false} is VALID [2022-02-20 18:52:10,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {7017#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~3#1;main_~node1__m1~3#1 := ~nomsg~0; {7017#false} is VALID [2022-02-20 18:52:10,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {7017#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; {7017#false} is VALID [2022-02-20 18:52:10,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {7017#false} assume !(main_~node1__m1~3#1 != ~nomsg~0);~mode1~0 := 0; {7017#false} is VALID [2022-02-20 18:52:10,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {7017#false} ~__tmp_2179_0~0 := main_~main____CPAchecker_TMP_0~2#1; {7017#false} is VALID [2022-02-20 18:52:10,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {7017#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2179_0~0;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {7017#false} is VALID [2022-02-20 18:52:10,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {7017#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~4#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7017#false} is VALID [2022-02-20 18:52:10,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {7017#false} assume main_~node2__m2~4#1 != ~nomsg~0; {7017#false} is VALID [2022-02-20 18:52:10,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {7017#false} assume !(main_~node2__m2~4#1 > ~id2~0); {7017#false} is VALID [2022-02-20 18:52:10,758 INFO L290 TraceCheckUtils]: 51: Hoare triple {7017#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; {7017#false} is VALID [2022-02-20 18:52:10,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {7017#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7017#false} is VALID [2022-02-20 18:52:10,758 INFO L290 TraceCheckUtils]: 53: Hoare triple {7017#false} assume main_~node3__m3~4#1 != ~nomsg~0; {7017#false} is VALID [2022-02-20 18:52:10,758 INFO L290 TraceCheckUtils]: 54: Hoare triple {7017#false} assume !(main_~node3__m3~4#1 > ~id3~0); {7017#false} is VALID [2022-02-20 18:52:10,758 INFO L290 TraceCheckUtils]: 55: Hoare triple {7017#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; {7017#false} is VALID [2022-02-20 18:52:10,759 INFO L290 TraceCheckUtils]: 56: Hoare triple {7017#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7017#false} is VALID [2022-02-20 18:52:10,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {7017#false} assume !(main_~node4__m4~5#1 != ~nomsg~0);~mode4~0 := 0;~__tmp_2249_0~0 := main_~main____CPAchecker_TMP_0~3#1; {7017#false} is VALID [2022-02-20 18:52:10,759 INFO L290 TraceCheckUtils]: 58: Hoare triple {7017#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2249_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; {7017#false} is VALID [2022-02-20 18:52:10,759 INFO L290 TraceCheckUtils]: 59: Hoare triple {7017#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_2264~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_2264~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; {7017#false} is VALID [2022-02-20 18:52:10,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {7017#false} assume 0 == main_~assert__arg~4#1 % 256; {7017#false} is VALID [2022-02-20 18:52:10,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {7017#false} assume !false; {7017#false} is VALID [2022-02-20 18:52:10,760 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:10,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:10,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035657244] [2022-02-20 18:52:10,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035657244] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:10,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:10,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:10,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632689250] [2022-02-20 18:52:10,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:10,761 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:52:10,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:10,761 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:52:10,793 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:52:10,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:10,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:10,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:10,794 INFO L87 Difference]: Start difference. First operand 335 states and 421 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:52:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:11,524 INFO L93 Difference]: Finished difference Result 433 states and 540 transitions. [2022-02-20 18:52:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:11,525 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:52:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:11,525 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:52:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-02-20 18:52:11,527 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:52:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-02-20 18:52:11,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 540 transitions. [2022-02-20 18:52:11,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 540 edges. 540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:11,888 INFO L225 Difference]: With dead ends: 433 [2022-02-20 18:52:11,888 INFO L226 Difference]: Without dead ends: 261 [2022-02-20 18:52:11,888 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:52:11,889 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 899 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:11,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [899 Valid, 209 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-02-20 18:52:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-02-20 18:52:12,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:12,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 261 states, 250 states have (on average 1.296) internal successors, (324), 260 states have internal predecessors, (324), 0 states have call successors, (0), 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:12,153 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 261 states, 250 states have (on average 1.296) internal successors, (324), 260 states have internal predecessors, (324), 0 states have call successors, (0), 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:12,154 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 261 states, 250 states have (on average 1.296) internal successors, (324), 260 states have internal predecessors, (324), 0 states have call successors, (0), 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:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:12,157 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2022-02-20 18:52:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 324 transitions. [2022-02-20 18:52:12,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:12,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:12,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.296) internal successors, (324), 260 states have internal predecessors, (324), 0 states have call successors, (0), 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 261 states. [2022-02-20 18:52:12,158 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.296) internal successors, (324), 260 states have internal predecessors, (324), 0 states have call successors, (0), 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 261 states. [2022-02-20 18:52:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:12,162 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2022-02-20 18:52:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 324 transitions. [2022-02-20 18:52:12,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:12,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:12,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:12,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.296) internal successors, (324), 260 states have internal predecessors, (324), 0 states have call successors, (0), 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:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 324 transitions. [2022-02-20 18:52:12,166 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 324 transitions. Word has length 62 [2022-02-20 18:52:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:12,166 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 324 transitions. [2022-02-20 18:52:12,166 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:52:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 324 transitions. [2022-02-20 18:52:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:12,167 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:12,167 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:52:12,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:52:12,167 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:52:12,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash -699288056, now seen corresponding path program 1 times [2022-02-20 18:52:12,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:12,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762855134] [2022-02-20 18:52:12,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:12,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {8428#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {8430#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:12,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {8430#(<= (+ ~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; {8431#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:12,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {8431#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {8431#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:12,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {8431#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {8432#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:12,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {8432#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {8432#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:12,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {8432#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {8433#(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; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {8433#(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; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {8433#(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; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {8433#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:12,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {8433#(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; {8434#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:12,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {8434#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8434#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:12,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {8434#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {8434#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:12,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {8434#(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; {8434#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:12,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {8434#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8434#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:12,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {8434#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {8434#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:12,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {8434#(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; {8434#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:12,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {8434#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {8434#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:12,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {8434#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {8434#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:12,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {8434#(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; {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {8435#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {8435#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 4); {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {8435#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {8435#(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; {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {8435#(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; {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {8435#(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; {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {8435#(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; {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,386 INFO L290 TraceCheckUtils]: 46: Hoare triple {8435#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,386 INFO L290 TraceCheckUtils]: 47: Hoare triple {8435#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {8435#(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; {8435#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:12,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {8435#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8436#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:52:12,387 INFO L290 TraceCheckUtils]: 50: Hoare triple {8436#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {8429#false} is VALID [2022-02-20 18:52:12,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {8429#false} ~__tmp_1660_0~0 := main_~main____CPAchecker_TMP_0~0#1; {8429#false} is VALID [2022-02-20 18:52:12,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {8429#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1660_0~0;havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {8429#false} is VALID [2022-02-20 18:52:12,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {8429#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8429#false} is VALID [2022-02-20 18:52:12,388 INFO L290 TraceCheckUtils]: 54: Hoare triple {8429#false} assume main_~node3__m3~11#1 != ~nomsg~0; {8429#false} is VALID [2022-02-20 18:52:12,388 INFO L290 TraceCheckUtils]: 55: Hoare triple {8429#false} assume !(main_~node3__m3~11#1 > ~id3~0); {8429#false} is VALID [2022-02-20 18:52:12,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {8429#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; {8429#false} is VALID [2022-02-20 18:52:12,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {8429#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~13#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8429#false} is VALID [2022-02-20 18:52:12,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {8429#false} assume !(main_~node4__m4~13#1 != ~nomsg~0);~mode4~0 := 0; {8429#false} is VALID [2022-02-20 18:52:12,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {8429#false} ~__tmp_1483_0~0 := main_~main____CPAchecker_TMP_0~8#1; {8429#false} is VALID [2022-02-20 18:52:12,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {8429#false} main_~main____CPAchecker_TMP_0~10#1 := ~__tmp_1483_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; {8429#false} is VALID [2022-02-20 18:52:12,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {8429#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~21#1 := 0;~__return_1498~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_1498~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; {8429#false} is VALID [2022-02-20 18:52:12,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {8429#false} assume 0 == main_~assert__arg~17#1 % 256; {8429#false} is VALID [2022-02-20 18:52:12,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {8429#false} assume !false; {8429#false} is VALID [2022-02-20 18:52:12,389 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:12,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:12,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762855134] [2022-02-20 18:52:12,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762855134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:12,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:12,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:12,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011347159] [2022-02-20 18:52:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:12,391 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:52:12,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:12,391 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:52:12,433 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:52:12,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:12,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:12,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:12,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:12,434 INFO L87 Difference]: Start difference. First operand 261 states and 324 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:52:15,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:15,130 INFO L93 Difference]: Finished difference Result 607 states and 794 transitions. [2022-02-20 18:52:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:15,131 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:52:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:15,131 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:52:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 794 transitions. [2022-02-20 18:52:15,134 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:52:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 794 transitions. [2022-02-20 18:52:15,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 794 transitions. [2022-02-20 18:52:15,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 794 edges. 794 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:15,688 INFO L225 Difference]: With dead ends: 607 [2022-02-20 18:52:15,688 INFO L226 Difference]: Without dead ends: 515 [2022-02-20 18:52:15,689 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:52:15,691 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 1628 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:15,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1628 Valid, 925 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-20 18:52:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 261. [2022-02-20 18:52:16,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:16,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 261 states, 250 states have (on average 1.292) internal successors, (323), 260 states have internal predecessors, (323), 0 states have call successors, (0), 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:16,051 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 261 states, 250 states have (on average 1.292) internal successors, (323), 260 states have internal predecessors, (323), 0 states have call successors, (0), 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:16,051 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 261 states, 250 states have (on average 1.292) internal successors, (323), 260 states have internal predecessors, (323), 0 states have call successors, (0), 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:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:16,062 INFO L93 Difference]: Finished difference Result 515 states and 668 transitions. [2022-02-20 18:52:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 668 transitions. [2022-02-20 18:52:16,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:16,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:16,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.292) internal successors, (323), 260 states have internal predecessors, (323), 0 states have call successors, (0), 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 515 states. [2022-02-20 18:52:16,064 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.292) internal successors, (323), 260 states have internal predecessors, (323), 0 states have call successors, (0), 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 515 states. [2022-02-20 18:52:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:16,074 INFO L93 Difference]: Finished difference Result 515 states and 668 transitions. [2022-02-20 18:52:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 668 transitions. [2022-02-20 18:52:16,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:16,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:16,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:16,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.292) internal successors, (323), 260 states have internal predecessors, (323), 0 states have call successors, (0), 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:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 323 transitions. [2022-02-20 18:52:16,079 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 323 transitions. Word has length 64 [2022-02-20 18:52:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:16,079 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 323 transitions. [2022-02-20 18:52:16,079 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:52:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 323 transitions. [2022-02-20 18:52:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:16,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:16,082 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:52:16,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:52:16,082 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:52:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1796013608, now seen corresponding path program 1 times [2022-02-20 18:52:16,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:16,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912398198] [2022-02-20 18:52:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:16,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:16,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {10622#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {10624#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:16,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {10624#(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; {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {10625#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {10626#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {10626#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {10626#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {10627#(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; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {10627#(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; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {10627#(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; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {10627#(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; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {10627#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:16,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {10627#(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; {10628#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:16,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {10628#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10628#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:16,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {10628#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {10628#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:16,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {10628#(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; {10628#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:16,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {10628#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10628#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:16,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {10628#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {10628#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:16,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {10628#(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; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {10629#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {10629#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,261 INFO L290 TraceCheckUtils]: 41: Hoare triple {10629#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {10629#(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; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {10629#(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; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {10629#(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; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {10629#(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; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {10629#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {10629#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {10629#(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; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {10629#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {10629#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {10629#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {10629#(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; {10629#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:16,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {10629#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10630#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:52:16,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {10630#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0);~mode3~0 := 0; {10623#false} is VALID [2022-02-20 18:52:16,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {10623#false} ~__tmp_2119_0~0 := main_~main____CPAchecker_TMP_0~0#1; {10623#false} is VALID [2022-02-20 18:52:16,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {10623#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_2119_0~0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {10623#false} is VALID [2022-02-20 18:52:16,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {10623#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10623#false} is VALID [2022-02-20 18:52:16,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {10623#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {10623#false} is VALID [2022-02-20 18:52:16,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {10623#false} ~__tmp_1919_0~0 := main_~main____CPAchecker_TMP_0~4#1; {10623#false} is VALID [2022-02-20 18:52:16,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {10623#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_1919_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; {10623#false} is VALID [2022-02-20 18:52:16,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {10623#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~13#1 := 0;~__return_1934~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_1934~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; {10623#false} is VALID [2022-02-20 18:52:16,270 INFO L290 TraceCheckUtils]: 62: Hoare triple {10623#false} assume 0 == main_~assert__arg~9#1 % 256; {10623#false} is VALID [2022-02-20 18:52:16,271 INFO L290 TraceCheckUtils]: 63: Hoare triple {10623#false} assume !false; {10623#false} is VALID [2022-02-20 18:52:16,272 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:16,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:16,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912398198] [2022-02-20 18:52:16,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912398198] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:16,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:16,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:16,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729972319] [2022-02-20 18:52:16,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:16,276 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:52:16,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:16,276 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:52:16,322 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:52:16,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:16,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:16,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:16,323 INFO L87 Difference]: Start difference. First operand 261 states and 323 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:52:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,213 INFO L93 Difference]: Finished difference Result 579 states and 758 transitions. [2022-02-20 18:52:19,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:19,213 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:52:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:19,213 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:52:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 758 transitions. [2022-02-20 18:52:19,218 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:52:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 758 transitions. [2022-02-20 18:52:19,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 758 transitions. [2022-02-20 18:52:19,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 758 edges. 758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,649 INFO L225 Difference]: With dead ends: 579 [2022-02-20 18:52:19,649 INFO L226 Difference]: Without dead ends: 511 [2022-02-20 18:52:19,649 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:52:19,655 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 1916 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:19,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1916 Valid, 1070 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-02-20 18:52:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 261. [2022-02-20 18:52:20,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:20,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 261 states, 250 states have (on average 1.288) internal successors, (322), 260 states have internal predecessors, (322), 0 states have call successors, (0), 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:20,062 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 261 states, 250 states have (on average 1.288) internal successors, (322), 260 states have internal predecessors, (322), 0 states have call successors, (0), 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:20,063 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 261 states, 250 states have (on average 1.288) internal successors, (322), 260 states have internal predecessors, (322), 0 states have call successors, (0), 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:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:20,073 INFO L93 Difference]: Finished difference Result 511 states and 662 transitions. [2022-02-20 18:52:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 662 transitions. [2022-02-20 18:52:20,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:20,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:20,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.288) internal successors, (322), 260 states have internal predecessors, (322), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:52:20,074 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.288) internal successors, (322), 260 states have internal predecessors, (322), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:52:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:20,083 INFO L93 Difference]: Finished difference Result 511 states and 662 transitions. [2022-02-20 18:52:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 662 transitions. [2022-02-20 18:52:20,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:20,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:20,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:20,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.288) internal successors, (322), 260 states have internal predecessors, (322), 0 states have call successors, (0), 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:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 322 transitions. [2022-02-20 18:52:20,088 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 322 transitions. Word has length 64 [2022-02-20 18:52:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:20,088 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 322 transitions. [2022-02-20 18:52:20,088 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:52:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 322 transitions. [2022-02-20 18:52:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:20,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:20,089 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:52:20,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:20,090 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:52:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1577721816, now seen corresponding path program 1 times [2022-02-20 18:52:20,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:20,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664954680] [2022-02-20 18:52:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:20,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {12776#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {12778#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:20,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {12778#(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; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {12779#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {12780#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {12780#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {12780#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {12780#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {12781#(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; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {12781#(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; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {12781#(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; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {12781#(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; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {12781#(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; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 != ~nomsg~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {12781#(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; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 != ~nomsg~0; {12781#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {12781#(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; {12782#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:20,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {12782#(not (= ~nomsg~0 ~p4_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {12782#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:20,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {12782#(not (= ~nomsg~0 ~p4_old~0))} assume !(~r1~0 >= 4); {12782#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:20,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {12782#(not (= ~nomsg~0 ~p4_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {12782#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:20,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {12782#(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; {12782#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:20,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {12782#(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; {12782#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:20,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {12782#(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; {12782#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:20,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {12782#(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; {12783#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:20,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {12783#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {12777#false} is VALID [2022-02-20 18:52:20,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {12777#false} ~__tmp_2403_0~0 := main_~main____CPAchecker_TMP_0~0#1; {12777#false} is VALID [2022-02-20 18:52:20,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {12777#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2403_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {12777#false} is VALID [2022-02-20 18:52:20,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {12777#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12777#false} is VALID [2022-02-20 18:52:20,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {12777#false} assume main_~node2__m2~2#1 != ~nomsg~0; {12777#false} is VALID [2022-02-20 18:52:20,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {12777#false} assume !(main_~node2__m2~2#1 > ~id2~0); {12777#false} is VALID [2022-02-20 18:52:20,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {12777#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; {12777#false} is VALID [2022-02-20 18:52:20,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {12777#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12777#false} is VALID [2022-02-20 18:52:20,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {12777#false} assume !(main_~node3__m3~2#1 != ~nomsg~0);~mode3~0 := 0; {12777#false} is VALID [2022-02-20 18:52:20,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {12777#false} ~__tmp_1996_0~0 := main_~main____CPAchecker_TMP_0~1#1; {12777#false} is VALID [2022-02-20 18:52:20,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {12777#false} main_~main____CPAchecker_TMP_0~5#1 := ~__tmp_1996_0~0;havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {12777#false} is VALID [2022-02-20 18:52:20,257 INFO L290 TraceCheckUtils]: 57: Hoare triple {12777#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12777#false} is VALID [2022-02-20 18:52:20,257 INFO L290 TraceCheckUtils]: 58: Hoare triple {12777#false} assume main_~node4__m4~8#1 != ~nomsg~0; {12777#false} is VALID [2022-02-20 18:52:20,257 INFO L290 TraceCheckUtils]: 59: Hoare triple {12777#false} assume !(main_~node4__m4~8#1 > ~id4~0); {12777#false} is VALID [2022-02-20 18:52:20,257 INFO L290 TraceCheckUtils]: 60: Hoare triple {12777#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; {12777#false} is VALID [2022-02-20 18:52:20,258 INFO L290 TraceCheckUtils]: 61: Hoare triple {12777#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_2040~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_2040~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; {12777#false} is VALID [2022-02-20 18:52:20,258 INFO L290 TraceCheckUtils]: 62: Hoare triple {12777#false} assume 0 == main_~assert__arg~7#1 % 256; {12777#false} is VALID [2022-02-20 18:52:20,258 INFO L290 TraceCheckUtils]: 63: Hoare triple {12777#false} assume !false; {12777#false} is VALID [2022-02-20 18:52:20,260 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:20,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:20,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664954680] [2022-02-20 18:52:20,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664954680] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:20,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:20,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:52:20,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554147364] [2022-02-20 18:52:20,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:20,262 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:20,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:20,262 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:52:20,288 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:52:20,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:52:20,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:20,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:52:20,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:52:20,289 INFO L87 Difference]: Start difference. First operand 261 states and 322 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:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,130 INFO L93 Difference]: Finished difference Result 516 states and 638 transitions. [2022-02-20 18:52:22,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:52:22,130 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:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:22,131 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:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 638 transitions. [2022-02-20 18:52:22,133 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:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 638 transitions. [2022-02-20 18:52:22,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 638 transitions. [2022-02-20 18:52:22,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:22,512 INFO L225 Difference]: With dead ends: 516 [2022-02-20 18:52:22,512 INFO L226 Difference]: Without dead ends: 375 [2022-02-20 18:52:22,513 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:22,514 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 1712 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:22,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1712 Valid, 673 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:52:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-02-20 18:52:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 261. [2022-02-20 18:52:22,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:22,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 261 states, 250 states have (on average 1.284) internal successors, (321), 260 states have internal predecessors, (321), 0 states have call successors, (0), 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,879 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 261 states, 250 states have (on average 1.284) internal successors, (321), 260 states have internal predecessors, (321), 0 states have call successors, (0), 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,880 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 261 states, 250 states have (on average 1.284) internal successors, (321), 260 states have internal predecessors, (321), 0 states have call successors, (0), 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,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,884 INFO L93 Difference]: Finished difference Result 375 states and 455 transitions. [2022-02-20 18:52:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 455 transitions. [2022-02-20 18:52:22,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.284) internal successors, (321), 260 states have internal predecessors, (321), 0 states have call successors, (0), 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 375 states. [2022-02-20 18:52:22,886 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.284) internal successors, (321), 260 states have internal predecessors, (321), 0 states have call successors, (0), 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 375 states. [2022-02-20 18:52:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,890 INFO L93 Difference]: Finished difference Result 375 states and 455 transitions. [2022-02-20 18:52:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 455 transitions. [2022-02-20 18:52:22,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:22,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.284) internal successors, (321), 260 states have internal predecessors, (321), 0 states have call successors, (0), 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,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 321 transitions. [2022-02-20 18:52:22,895 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 321 transitions. Word has length 64 [2022-02-20 18:52:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:22,895 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 321 transitions. [2022-02-20 18:52:22,895 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:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 321 transitions. [2022-02-20 18:52:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:22,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:22,896 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:22,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:22,896 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:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash -295025225, now seen corresponding path program 1 times [2022-02-20 18:52:22,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:22,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876699434] [2022-02-20 18:52:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:23,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {14550#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {14552#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:23,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {14552#(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; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {14553#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {14554#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:23,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {14554#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {14554#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:23,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {14554#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode3~0 % 256; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id4~0 >= 0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~st4~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send4~0 == ~id4~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode4~0 % 256; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id2~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id3~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id4~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id3~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id4~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {14555#(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; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {14555#(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; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {14555#(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; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send1~0 != ~nomsg~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {14555#(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; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send2~0 != ~nomsg~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {14555#(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; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send3~0 != ~nomsg~0; {14555#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:23,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {14555#(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; {14556#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {14556#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {14556#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {14556#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {14556#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {14556#(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; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {14557#(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; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {14557#(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; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {14557#(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; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {14557#(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; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {14557#(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; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {14557#(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; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~1#1 > ~id3~0); {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {14557#(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; {14557#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:23,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {14557#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14558#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~1#1|))} is VALID [2022-02-20 18:52:23,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {14558#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~1#1|))} assume !(main_~node4__m4~1#1 != ~nomsg~0);~mode4~0 := 0; {14551#false} is VALID [2022-02-20 18:52:23,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {14551#false} ~__tmp_2372_0~0 := main_~main____CPAchecker_TMP_0~0#1; {14551#false} is VALID [2022-02-20 18:52:23,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {14551#false} main_~main____CPAchecker_TMP_0~2#1 := ~__tmp_2372_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; {14551#false} is VALID [2022-02-20 18:52:23,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {14551#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2387~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2387~0;~__tmp_1734_0~0 := main_~main____CPAchecker_TMP_0~2#1; {14551#false} is VALID [2022-02-20 18:52:23,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {14551#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1734_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; {14551#false} is VALID [2022-02-20 18:52:23,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {14551#false} assume 0 == main_~assert__arg~13#1 % 256; {14551#false} is VALID [2022-02-20 18:52:23,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {14551#false} assume !false; {14551#false} is VALID [2022-02-20 18:52:23,056 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:23,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:23,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876699434] [2022-02-20 18:52:23,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876699434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:23,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:23,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:23,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464388897] [2022-02-20 18:52:23,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:23,057 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:23,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:23,058 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:23,103 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:23,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:23,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:23,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:23,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:23,104 INFO L87 Difference]: Start difference. First operand 261 states and 321 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:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:25,673 INFO L93 Difference]: Finished difference Result 560 states and 727 transitions. [2022-02-20 18:52:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:25,674 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:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:25,674 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:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 727 transitions. [2022-02-20 18:52:25,676 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:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 727 transitions. [2022-02-20 18:52:25,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 727 transitions. [2022-02-20 18:52:26,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:26,058 INFO L225 Difference]: With dead ends: 560 [2022-02-20 18:52:26,058 INFO L226 Difference]: Without dead ends: 503 [2022-02-20 18:52:26,058 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:26,059 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 1899 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1899 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:26,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1899 Valid, 985 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-20 18:52:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 261. [2022-02-20 18:52:26,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:26,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.28) internal successors, (320), 260 states have internal predecessors, (320), 0 states have call successors, (0), 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,434 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.28) internal successors, (320), 260 states have internal predecessors, (320), 0 states have call successors, (0), 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,436 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.28) internal successors, (320), 260 states have internal predecessors, (320), 0 states have call successors, (0), 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,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,458 INFO L93 Difference]: Finished difference Result 503 states and 644 transitions. [2022-02-20 18:52:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 644 transitions. [2022-02-20 18:52:26,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.28) internal successors, (320), 260 states have internal predecessors, (320), 0 states have call successors, (0), 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:52:26,472 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.28) internal successors, (320), 260 states have internal predecessors, (320), 0 states have call successors, (0), 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:52:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,481 INFO L93 Difference]: Finished difference Result 503 states and 644 transitions. [2022-02-20 18:52:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 644 transitions. [2022-02-20 18:52:26,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:26,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.28) internal successors, (320), 260 states have internal predecessors, (320), 0 states have call successors, (0), 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,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 320 transitions. [2022-02-20 18:52:26,495 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 320 transitions. Word has length 65 [2022-02-20 18:52:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:26,495 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 320 transitions. [2022-02-20 18:52:26,495 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:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 320 transitions. [2022-02-20 18:52:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:26,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:26,496 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,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:26,511 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:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash -168692467, now seen corresponding path program 1 times [2022-02-20 18:52:26,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:26,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476572922] [2022-02-20 18:52:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:26,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:26,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {16666#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {16668#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:26,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {16668#(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; {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {16669#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {16670#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {16670#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {16670#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {16670#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {16671#(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; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {16671#(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; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {16671#(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; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {16671#(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; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {16671#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {16671#(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; {16672#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {16672#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16672#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {16672#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {16672#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {16672#(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; {16672#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {16672#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {16672#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {16672#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {16672#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {16672#(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; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {16673#(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; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {16673#(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; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {16673#(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; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {16673#(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; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,672 INFO L290 TraceCheckUtils]: 47: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} ~__tmp_2403_0~0 := main_~main____CPAchecker_TMP_0~0#1; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2403_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,674 INFO L290 TraceCheckUtils]: 53: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {16673#(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; {16673#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {16673#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16674#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} is VALID [2022-02-20 18:52:26,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {16674#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} assume !(main_~node3__m3~2#1 != ~nomsg~0);~mode3~0 := 0; {16667#false} is VALID [2022-02-20 18:52:26,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {16667#false} ~__tmp_1996_0~0 := main_~main____CPAchecker_TMP_0~1#1; {16667#false} is VALID [2022-02-20 18:52:26,675 INFO L290 TraceCheckUtils]: 58: Hoare triple {16667#false} main_~main____CPAchecker_TMP_0~5#1 := ~__tmp_1996_0~0;havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {16667#false} is VALID [2022-02-20 18:52:26,675 INFO L290 TraceCheckUtils]: 59: Hoare triple {16667#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16667#false} is VALID [2022-02-20 18:52:26,675 INFO L290 TraceCheckUtils]: 60: Hoare triple {16667#false} assume main_~node4__m4~8#1 != ~nomsg~0; {16667#false} is VALID [2022-02-20 18:52:26,675 INFO L290 TraceCheckUtils]: 61: Hoare triple {16667#false} assume !(main_~node4__m4~8#1 > ~id4~0); {16667#false} is VALID [2022-02-20 18:52:26,675 INFO L290 TraceCheckUtils]: 62: Hoare triple {16667#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; {16667#false} is VALID [2022-02-20 18:52:26,675 INFO L290 TraceCheckUtils]: 63: Hoare triple {16667#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_2040~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_2040~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; {16667#false} is VALID [2022-02-20 18:52:26,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {16667#false} assume 0 == main_~assert__arg~7#1 % 256; {16667#false} is VALID [2022-02-20 18:52:26,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {16667#false} assume !false; {16667#false} is VALID [2022-02-20 18:52:26,676 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,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:26,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476572922] [2022-02-20 18:52:26,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476572922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:26,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:26,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:26,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367517873] [2022-02-20 18:52:26,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:26,678 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,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:26,678 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,707 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,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:26,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:26,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:26,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:26,707 INFO L87 Difference]: Start difference. First operand 261 states and 320 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:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:29,178 INFO L93 Difference]: Finished difference Result 530 states and 680 transitions. [2022-02-20 18:52:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:29,178 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:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:29,179 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:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 680 transitions. [2022-02-20 18:52:29,188 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:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 680 transitions. [2022-02-20 18:52:29,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 680 transitions. [2022-02-20 18:52:29,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 680 edges. 680 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:29,563 INFO L225 Difference]: With dead ends: 530 [2022-02-20 18:52:29,563 INFO L226 Difference]: Without dead ends: 511 [2022-02-20 18:52:29,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:29,564 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 1848 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:29,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1848 Valid, 1103 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-02-20 18:52:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 261. [2022-02-20 18:52:29,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:29,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 261 states, 250 states have (on average 1.276) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 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:29,923 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 261 states, 250 states have (on average 1.276) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 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:29,923 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 261 states, 250 states have (on average 1.276) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 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:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:29,931 INFO L93 Difference]: Finished difference Result 511 states and 659 transitions. [2022-02-20 18:52:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 659 transitions. [2022-02-20 18:52:29,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:29,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:29,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.276) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:52:29,933 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.276) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:52:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:29,942 INFO L93 Difference]: Finished difference Result 511 states and 659 transitions. [2022-02-20 18:52:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 659 transitions. [2022-02-20 18:52:29,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:29,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:29,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:29,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.276) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 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:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 319 transitions. [2022-02-20 18:52:29,946 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 319 transitions. Word has length 66 [2022-02-20 18:52:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:29,947 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 319 transitions. [2022-02-20 18:52:29,947 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:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 319 transitions. [2022-02-20 18:52:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:29,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:29,947 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:29,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:29,948 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:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1424145869, now seen corresponding path program 1 times [2022-02-20 18:52:29,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:29,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706710505] [2022-02-20 18:52:29,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:30,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {18749#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {18751#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:30,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {18751#(<= (+ ~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; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {18752#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {18753#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {18753#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {18753#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:30,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {18753#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {18754#(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; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {18754#(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; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {18754#(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; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {18754#(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; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {18754#(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; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {18754#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:30,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {18754#(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; {18755#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {18755#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {18755#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {18755#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {18755#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {18755#(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; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {18756#(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; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {18756#(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; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {18756#(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; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {18756#(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; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,095 INFO L290 TraceCheckUtils]: 46: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,095 INFO L290 TraceCheckUtils]: 48: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} ~mode1~0 := 0; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} ~__tmp_2403_0~0 := main_~main____CPAchecker_TMP_0~0#1; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,096 INFO L290 TraceCheckUtils]: 50: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2403_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,096 INFO L290 TraceCheckUtils]: 51: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,096 INFO L290 TraceCheckUtils]: 52: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {18756#(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; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~2#1 != ~nomsg~0; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~2#1 > ~id3~0); {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {18756#(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; {18756#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:30,098 INFO L290 TraceCheckUtils]: 59: Hoare triple {18756#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~2#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18757#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~2#1|))} is VALID [2022-02-20 18:52:30,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {18757#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~2#1|))} assume !(main_~node4__m4~2#1 != ~nomsg~0);~mode4~0 := 0; {18750#false} is VALID [2022-02-20 18:52:30,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {18750#false} ~__tmp_2249_0~0 := main_~main____CPAchecker_TMP_0~1#1; {18750#false} is VALID [2022-02-20 18:52:30,098 INFO L290 TraceCheckUtils]: 62: Hoare triple {18750#false} main_~main____CPAchecker_TMP_0~3#1 := ~__tmp_2249_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; {18750#false} is VALID [2022-02-20 18:52:30,099 INFO L290 TraceCheckUtils]: 63: Hoare triple {18750#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_2264~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_2264~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; {18750#false} is VALID [2022-02-20 18:52:30,099 INFO L290 TraceCheckUtils]: 64: Hoare triple {18750#false} assume 0 == main_~assert__arg~4#1 % 256; {18750#false} is VALID [2022-02-20 18:52:30,099 INFO L290 TraceCheckUtils]: 65: Hoare triple {18750#false} assume !false; {18750#false} is VALID [2022-02-20 18:52:30,099 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:30,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:30,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706710505] [2022-02-20 18:52:30,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706710505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:30,100 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:30,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:30,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088126042] [2022-02-20 18:52:30,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:30,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:30,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:30,101 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:30,141 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:30,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:30,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:30,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:30,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:30,142 INFO L87 Difference]: Start difference. First operand 261 states and 319 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:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:32,296 INFO L93 Difference]: Finished difference Result 509 states and 648 transitions. [2022-02-20 18:52:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:32,296 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:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:32,297 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:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 648 transitions. [2022-02-20 18:52:32,299 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:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 648 transitions. [2022-02-20 18:52:32,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 648 transitions. [2022-02-20 18:52:32,578 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:32,589 INFO L225 Difference]: With dead ends: 509 [2022-02-20 18:52:32,589 INFO L226 Difference]: Without dead ends: 503 [2022-02-20 18:52:32,589 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:32,590 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 1384 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:32,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1384 Valid, 1061 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-20 18:52:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 261. [2022-02-20 18:52:33,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:33,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.272) internal successors, (318), 260 states have internal predecessors, (318), 0 states have call successors, (0), 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:33,032 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.272) internal successors, (318), 260 states have internal predecessors, (318), 0 states have call successors, (0), 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:33,032 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.272) internal successors, (318), 260 states have internal predecessors, (318), 0 states have call successors, (0), 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:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:33,040 INFO L93 Difference]: Finished difference Result 503 states and 642 transitions. [2022-02-20 18:52:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 642 transitions. [2022-02-20 18:52:33,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:33,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:33,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.272) internal successors, (318), 260 states have internal predecessors, (318), 0 states have call successors, (0), 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:52:33,042 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.272) internal successors, (318), 260 states have internal predecessors, (318), 0 states have call successors, (0), 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:52:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:33,050 INFO L93 Difference]: Finished difference Result 503 states and 642 transitions. [2022-02-20 18:52:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 642 transitions. [2022-02-20 18:52:33,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:33,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:33,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:33,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.272) internal successors, (318), 260 states have internal predecessors, (318), 0 states have call successors, (0), 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:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 318 transitions. [2022-02-20 18:52:33,055 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 318 transitions. Word has length 66 [2022-02-20 18:52:33,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:33,055 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 318 transitions. [2022-02-20 18:52:33,055 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:33,055 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 318 transitions. [2022-02-20 18:52:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:33,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:33,056 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:33,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:33,056 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:33,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash -155488627, now seen corresponding path program 1 times [2022-02-20 18:52:33,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:33,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822588636] [2022-02-20 18:52:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:33,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {20790#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {20792#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:33,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {20792#(<= (+ ~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; {20793#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:33,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {20793#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {20793#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:33,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {20793#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {20794#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:33,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {20794#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {20794#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:33,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {20794#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {20795#(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; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {20795#(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; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {20795#(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; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {20795#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:33,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {20795#(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; {20796#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:33,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {20796#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {20796#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:33,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {20796#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {20796#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:33,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {20796#(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; {20796#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:33,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {20796#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {20796#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:33,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {20796#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {20796#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:33,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {20796#(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; {20796#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:33,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {20796#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {20796#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:33,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {20796#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {20796#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:33,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {20796#(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; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {20797#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {20797#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 4); {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {20797#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {20797#(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; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {20797#(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; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {20797#(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; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {20797#(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; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {20797#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,187 INFO L290 TraceCheckUtils]: 47: Hoare triple {20797#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {20797#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {20797#(not (= ~nomsg~0 ~p1_old~0))} ~__tmp_2403_0~0 := main_~main____CPAchecker_TMP_0~0#1; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {20797#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2403_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {20797#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:33,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {20797#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20798#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} is VALID [2022-02-20 18:52:33,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {20798#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} assume !(main_~node2__m2~2#1 != ~nomsg~0);~mode2~0 := 0; {20791#false} is VALID [2022-02-20 18:52:33,188 INFO L290 TraceCheckUtils]: 53: Hoare triple {20791#false} ~__tmp_1534_0~0 := main_~main____CPAchecker_TMP_0~1#1; {20791#false} is VALID [2022-02-20 18:52:33,188 INFO L290 TraceCheckUtils]: 54: Hoare triple {20791#false} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_1534_0~0;havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {20791#false} is VALID [2022-02-20 18:52:33,188 INFO L290 TraceCheckUtils]: 55: Hoare triple {20791#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20791#false} is VALID [2022-02-20 18:52:33,189 INFO L290 TraceCheckUtils]: 56: Hoare triple {20791#false} assume main_~node3__m3~12#1 != ~nomsg~0; {20791#false} is VALID [2022-02-20 18:52:33,189 INFO L290 TraceCheckUtils]: 57: Hoare triple {20791#false} assume !(main_~node3__m3~12#1 > ~id3~0); {20791#false} is VALID [2022-02-20 18:52:33,189 INFO L290 TraceCheckUtils]: 58: Hoare triple {20791#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; {20791#false} is VALID [2022-02-20 18:52:33,189 INFO L290 TraceCheckUtils]: 59: Hoare triple {20791#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~14#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20791#false} is VALID [2022-02-20 18:52:33,189 INFO L290 TraceCheckUtils]: 60: Hoare triple {20791#false} assume main_~node4__m4~14#1 != ~nomsg~0; {20791#false} is VALID [2022-02-20 18:52:33,189 INFO L290 TraceCheckUtils]: 61: Hoare triple {20791#false} assume !(main_~node4__m4~14#1 > ~id4~0); {20791#false} is VALID [2022-02-20 18:52:33,189 INFO L290 TraceCheckUtils]: 62: Hoare triple {20791#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; {20791#false} is VALID [2022-02-20 18:52:33,189 INFO L290 TraceCheckUtils]: 63: Hoare triple {20791#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~19#1 := 0;~__return_1607~0 := main_~check__tmp~19#1;main_~main__c1~0#1 := ~__return_1607~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; {20791#false} is VALID [2022-02-20 18:52:33,189 INFO L290 TraceCheckUtils]: 64: Hoare triple {20791#false} assume 0 == main_~assert__arg~15#1 % 256; {20791#false} is VALID [2022-02-20 18:52:33,190 INFO L290 TraceCheckUtils]: 65: Hoare triple {20791#false} assume !false; {20791#false} is VALID [2022-02-20 18:52:33,190 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:33,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:33,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822588636] [2022-02-20 18:52:33,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822588636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:33,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:33,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:33,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573879594] [2022-02-20 18:52:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:33,191 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:33,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:33,191 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:33,233 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:33,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:33,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:33,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:33,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:33,234 INFO L87 Difference]: Start difference. First operand 261 states and 318 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,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:35,443 INFO L93 Difference]: Finished difference Result 613 states and 791 transitions. [2022-02-20 18:52:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:35,443 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,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:35,443 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,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 791 transitions. [2022-02-20 18:52:35,446 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,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 791 transitions. [2022-02-20 18:52:35,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 791 transitions. [2022-02-20 18:52:35,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 791 edges. 791 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:35,797 INFO L225 Difference]: With dead ends: 613 [2022-02-20 18:52:35,797 INFO L226 Difference]: Without dead ends: 515 [2022-02-20 18:52:35,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:35,798 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 983 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:35,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [983 Valid, 1240 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-20 18:52:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 261. [2022-02-20 18:52:36,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:36,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 261 states, 250 states have (on average 1.268) internal successors, (317), 260 states have internal predecessors, (317), 0 states have call successors, (0), 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,332 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 261 states, 250 states have (on average 1.268) internal successors, (317), 260 states have internal predecessors, (317), 0 states have call successors, (0), 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,332 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 261 states, 250 states have (on average 1.268) internal successors, (317), 260 states have internal predecessors, (317), 0 states have call successors, (0), 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,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,341 INFO L93 Difference]: Finished difference Result 515 states and 659 transitions. [2022-02-20 18:52:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 659 transitions. [2022-02-20 18:52:36,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.268) internal successors, (317), 260 states have internal predecessors, (317), 0 states have call successors, (0), 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 515 states. [2022-02-20 18:52:36,342 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.268) internal successors, (317), 260 states have internal predecessors, (317), 0 states have call successors, (0), 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 515 states. [2022-02-20 18:52:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,351 INFO L93 Difference]: Finished difference Result 515 states and 659 transitions. [2022-02-20 18:52:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 659 transitions. [2022-02-20 18:52:36,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:36,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.268) internal successors, (317), 260 states have internal predecessors, (317), 0 states have call successors, (0), 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,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 317 transitions. [2022-02-20 18:52:36,355 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 317 transitions. Word has length 66 [2022-02-20 18:52:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:36,356 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 317 transitions. [2022-02-20 18:52:36,356 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,356 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 317 transitions. [2022-02-20 18:52:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:36,356 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:36,356 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:36,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:36,357 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:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash -131812051, now seen corresponding path program 1 times [2022-02-20 18:52:36,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:36,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988586787] [2022-02-20 18:52:36,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:36,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:36,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {22990#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {22992#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:36,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {22992#(<= (+ ~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; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {22993#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {22994#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {22994#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {22994#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:36,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {22994#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {22995#(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; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {22995#(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; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {22995#(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; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {22995#(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; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {22995#(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; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {22995#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:36,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {22995#(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; {22996#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {22996#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {22996#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {22996#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {22996#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {22996#(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; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {22997#(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; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {22997#(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; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {22997#(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; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {22997#(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; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {22997#(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; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,490 INFO L290 TraceCheckUtils]: 51: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} ~mode2~0 := 0; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} ~__tmp_1660_0~0 := main_~main____CPAchecker_TMP_0~0#1; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1660_0~0;havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~11#1 != ~nomsg~0; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~11#1 > ~id3~0); {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {22997#(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; {22997#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:36,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {22997#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~13#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22998#(not (= |ULTIMATE.start_main_~node4__m4~13#1| ~nomsg~0))} is VALID [2022-02-20 18:52:36,492 INFO L290 TraceCheckUtils]: 60: Hoare triple {22998#(not (= |ULTIMATE.start_main_~node4__m4~13#1| ~nomsg~0))} assume !(main_~node4__m4~13#1 != ~nomsg~0);~mode4~0 := 0; {22991#false} is VALID [2022-02-20 18:52:36,492 INFO L290 TraceCheckUtils]: 61: Hoare triple {22991#false} ~__tmp_1483_0~0 := main_~main____CPAchecker_TMP_0~8#1; {22991#false} is VALID [2022-02-20 18:52:36,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {22991#false} main_~main____CPAchecker_TMP_0~10#1 := ~__tmp_1483_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; {22991#false} is VALID [2022-02-20 18:52:36,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {22991#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~21#1 := 0;~__return_1498~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_1498~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; {22991#false} is VALID [2022-02-20 18:52:36,493 INFO L290 TraceCheckUtils]: 64: Hoare triple {22991#false} assume 0 == main_~assert__arg~17#1 % 256; {22991#false} is VALID [2022-02-20 18:52:36,493 INFO L290 TraceCheckUtils]: 65: Hoare triple {22991#false} assume !false; {22991#false} is VALID [2022-02-20 18:52:36,493 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,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:36,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988586787] [2022-02-20 18:52:36,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988586787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:36,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:36,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:36,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372074471] [2022-02-20 18:52:36,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:36,494 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:36,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:36,495 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:36,541 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:36,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:36,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:36,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:36,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:36,542 INFO L87 Difference]: Start difference. First operand 261 states and 317 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:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:39,452 INFO L93 Difference]: Finished difference Result 563 states and 726 transitions. [2022-02-20 18:52:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:39,452 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:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:39,452 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:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 726 transitions. [2022-02-20 18:52:39,455 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:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 726 transitions. [2022-02-20 18:52:39,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 726 transitions. [2022-02-20 18:52:39,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:39,781 INFO L225 Difference]: With dead ends: 563 [2022-02-20 18:52:39,781 INFO L226 Difference]: Without dead ends: 503 [2022-02-20 18:52:39,781 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:39,782 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1366 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:39,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 1072 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-20 18:52:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 261. [2022-02-20 18:52:40,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:40,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.264) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 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:40,264 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.264) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 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:40,264 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.264) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 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:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:40,272 INFO L93 Difference]: Finished difference Result 503 states and 640 transitions. [2022-02-20 18:52:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 640 transitions. [2022-02-20 18:52:40,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:40,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:40,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.264) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 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:52:40,274 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.264) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 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:52:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:40,282 INFO L93 Difference]: Finished difference Result 503 states and 640 transitions. [2022-02-20 18:52:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 640 transitions. [2022-02-20 18:52:40,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:40,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:40,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:40,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.264) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 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:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 316 transitions. [2022-02-20 18:52:40,287 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 316 transitions. Word has length 66 [2022-02-20 18:52:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:40,287 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 316 transitions. [2022-02-20 18:52:40,287 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:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 316 transitions. [2022-02-20 18:52:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:40,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:40,288 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:40,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:52:40,288 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:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2058619373, now seen corresponding path program 1 times [2022-02-20 18:52:40,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:40,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877079180] [2022-02-20 18:52:40,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:40,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:40,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {25107#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {25109#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {25109#(<= (+ ~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; {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:40,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:40,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:40,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:40,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:40,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:40,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {25110#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {25111#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:40,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {25111#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st2~0; {25111#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:40,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {25111#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {25112#(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; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {25112#(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; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {25112#(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; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {25112#(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; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {25112#(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; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {25112#(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; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {25112#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:40,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {25112#(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; {25113#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:40,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {25113#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {25113#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:40,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {25113#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {25113#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:40,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {25113#(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; {25113#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:40,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {25113#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {25113#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:40,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {25113#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {25113#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:40,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {25113#(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; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {25114#(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; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {25114#(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; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {25114#(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; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {25114#(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; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {25114#(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; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,415 INFO L290 TraceCheckUtils]: 50: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,416 INFO L290 TraceCheckUtils]: 53: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} ~__tmp_1660_0~0 := main_~main____CPAchecker_TMP_0~0#1; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1660_0~0;havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {25114#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:40,417 INFO L290 TraceCheckUtils]: 55: Hoare triple {25114#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25115#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~11#1|))} is VALID [2022-02-20 18:52:40,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {25115#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~11#1|))} assume !(main_~node3__m3~11#1 != ~nomsg~0);~mode3~0 := 0; {25108#false} is VALID [2022-02-20 18:52:40,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {25108#false} ~__tmp_1250_0~0 := main_~main____CPAchecker_TMP_0~8#1; {25108#false} is VALID [2022-02-20 18:52:40,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {25108#false} main_~main____CPAchecker_TMP_0~12#1 := ~__tmp_1250_0~0;havoc main_~node4__m4~19#1;main_~node4__m4~19#1 := ~nomsg~0; {25108#false} is VALID [2022-02-20 18:52:40,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {25108#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~19#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25108#false} is VALID [2022-02-20 18:52:40,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {25108#false} assume main_~node4__m4~19#1 != ~nomsg~0; {25108#false} is VALID [2022-02-20 18:52:40,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {25108#false} assume !(main_~node4__m4~19#1 > ~id4~0); {25108#false} is VALID [2022-02-20 18:52:40,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {25108#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; {25108#false} is VALID [2022-02-20 18:52:40,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {25108#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~25#1 := 0;~__return_1294~0 := main_~check__tmp~25#1;main_~main__c1~0#1 := ~__return_1294~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; {25108#false} is VALID [2022-02-20 18:52:40,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {25108#false} assume 0 == main_~assert__arg~21#1 % 256; {25108#false} is VALID [2022-02-20 18:52:40,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {25108#false} assume !false; {25108#false} is VALID [2022-02-20 18:52:40,418 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:40,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:40,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877079180] [2022-02-20 18:52:40,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877079180] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:40,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:40,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:40,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112312560] [2022-02-20 18:52:40,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:40,419 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:40,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:40,420 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:40,464 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:40,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:40,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:40,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:40,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:40,465 INFO L87 Difference]: Start difference. First operand 261 states and 316 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:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:43,133 INFO L93 Difference]: Finished difference Result 584 states and 755 transitions. [2022-02-20 18:52:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:43,134 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:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:43,134 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:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 755 transitions. [2022-02-20 18:52:43,137 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:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 755 transitions. [2022-02-20 18:52:43,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 755 transitions. [2022-02-20 18:52:43,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 755 edges. 755 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:43,474 INFO L225 Difference]: With dead ends: 584 [2022-02-20 18:52:43,475 INFO L226 Difference]: Without dead ends: 511 [2022-02-20 18:52:43,475 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:43,475 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1380 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:43,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1380 Valid, 1297 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-02-20 18:52:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 261. [2022-02-20 18:52:44,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:44,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 261 states, 250 states have (on average 1.26) internal successors, (315), 260 states have internal predecessors, (315), 0 states have call successors, (0), 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:44,175 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 261 states, 250 states have (on average 1.26) internal successors, (315), 260 states have internal predecessors, (315), 0 states have call successors, (0), 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:44,175 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 261 states, 250 states have (on average 1.26) internal successors, (315), 260 states have internal predecessors, (315), 0 states have call successors, (0), 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:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,183 INFO L93 Difference]: Finished difference Result 511 states and 653 transitions. [2022-02-20 18:52:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 653 transitions. [2022-02-20 18:52:44,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:44,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:44,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.26) internal successors, (315), 260 states have internal predecessors, (315), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:52:44,185 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.26) internal successors, (315), 260 states have internal predecessors, (315), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:52:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,193 INFO L93 Difference]: Finished difference Result 511 states and 653 transitions. [2022-02-20 18:52:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 653 transitions. [2022-02-20 18:52:44,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:44,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:44,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:44,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.26) internal successors, (315), 260 states have internal predecessors, (315), 0 states have call successors, (0), 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:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 315 transitions. [2022-02-20 18:52:44,197 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 315 transitions. Word has length 66 [2022-02-20 18:52:44,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:44,198 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 315 transitions. [2022-02-20 18:52:44,198 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:44,198 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 315 transitions. [2022-02-20 18:52:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:44,198 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:44,198 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:44,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:52:44,199 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:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:44,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1833305997, now seen corresponding path program 1 times [2022-02-20 18:52:44,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:44,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660995355] [2022-02-20 18:52:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:44,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:44,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {27264#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {27266#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {27266#(<= (+ ~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; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {27267#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {27268#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {27268#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {27268#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {27268#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {27269#(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; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {27269#(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; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {27269#(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; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {27269#(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; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {27269#(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; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {27269#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:44,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {27269#(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; {27270#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {27270#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {27270#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {27270#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {27270#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {27270#(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; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,307 INFO L290 TraceCheckUtils]: 42: Hoare triple {27271#(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; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,307 INFO L290 TraceCheckUtils]: 43: Hoare triple {27271#(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; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {27271#(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; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {27271#(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; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {27271#(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; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {27271#(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; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,310 INFO L290 TraceCheckUtils]: 54: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} ~mode3~0 := 0; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} ~__tmp_2119_0~0 := main_~main____CPAchecker_TMP_0~0#1; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_2119_0~0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {27271#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:44,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {27271#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {27272#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} is VALID [2022-02-20 18:52:44,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {27272#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {27265#false} is VALID [2022-02-20 18:52:44,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {27265#false} ~__tmp_1919_0~0 := main_~main____CPAchecker_TMP_0~4#1; {27265#false} is VALID [2022-02-20 18:52:44,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {27265#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_1919_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; {27265#false} is VALID [2022-02-20 18:52:44,312 INFO L290 TraceCheckUtils]: 63: Hoare triple {27265#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~13#1 := 0;~__return_1934~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_1934~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; {27265#false} is VALID [2022-02-20 18:52:44,312 INFO L290 TraceCheckUtils]: 64: Hoare triple {27265#false} assume 0 == main_~assert__arg~9#1 % 256; {27265#false} is VALID [2022-02-20 18:52:44,312 INFO L290 TraceCheckUtils]: 65: Hoare triple {27265#false} assume !false; {27265#false} is VALID [2022-02-20 18:52:44,312 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:44,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:44,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660995355] [2022-02-20 18:52:44,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660995355] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:44,313 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:44,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:44,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444235519] [2022-02-20 18:52:44,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:44,313 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:44,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:44,314 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:44,360 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:44,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:44,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:44,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:44,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:44,361 INFO L87 Difference]: Start difference. First operand 261 states and 315 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:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:47,283 INFO L93 Difference]: Finished difference Result 509 states and 644 transitions. [2022-02-20 18:52:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:47,284 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:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:47,284 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:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 644 transitions. [2022-02-20 18:52:47,286 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:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 644 transitions. [2022-02-20 18:52:47,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 644 transitions. [2022-02-20 18:52:47,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 644 edges. 644 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:47,566 INFO L225 Difference]: With dead ends: 509 [2022-02-20 18:52:47,567 INFO L226 Difference]: Without dead ends: 503 [2022-02-20 18:52:47,568 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:47,568 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1398 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:47,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 1201 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-20 18:52:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 261. [2022-02-20 18:52:48,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:48,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.256) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 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:48,011 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.256) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 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:48,012 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 261 states, 250 states have (on average 1.256) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 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:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,020 INFO L93 Difference]: Finished difference Result 503 states and 637 transitions. [2022-02-20 18:52:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 637 transitions. [2022-02-20 18:52:48,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:48,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:48,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 250 states have (on average 1.256) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 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:52:48,021 INFO L87 Difference]: Start difference. First operand has 261 states, 250 states have (on average 1.256) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 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:52:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,030 INFO L93 Difference]: Finished difference Result 503 states and 637 transitions. [2022-02-20 18:52:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 637 transitions. [2022-02-20 18:52:48,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:48,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:48,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:48,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.256) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 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:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2022-02-20 18:52:48,034 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 66 [2022-02-20 18:52:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:48,034 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2022-02-20 18:52:48,035 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:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2022-02-20 18:52:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:52:48,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:48,035 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:48,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:52:48,036 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:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash 817551922, now seen corresponding path program 1 times [2022-02-20 18:52:48,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:48,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405147176] [2022-02-20 18:52:48,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:48,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {29305#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {29305#true} is VALID [2022-02-20 18:52:48,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {29305#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; {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:48,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:48,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:48,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:48,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:48,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:48,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {29307#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {29308#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:48,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {29308#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {29308#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:48,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {29308#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {29309#(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:48,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {29309#(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; {29309#(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:48,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {29309#(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; {29310#(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:48,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {29310#(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; {29310#(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:48,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {29310#(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; {29310#(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:48,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {29310#(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; {29310#(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:48,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {29310#(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; {29310#(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:48,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {29310#(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; {29310#(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:48,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {29310#(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; {29310#(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:48,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {29310#(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; {29310#(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:48,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {29310#(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; {29310#(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:48,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {29310#(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; {29310#(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:48,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {29310#(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; {29310#(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:48,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {29310#(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; {29311#(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:48,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {29311#(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; {29311#(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:48,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {29311#(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; {29311#(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:48,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {29311#(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; {29311#(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:48,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {29311#(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; {29311#(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:48,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {29311#(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; {29311#(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:48,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {29311#(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; {29311#(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:48,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {29311#(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; {29311#(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:48,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {29311#(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; {29311#(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:48,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {29311#(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; {29311#(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:48,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {29311#(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; {29312#(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:48,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {29312#(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; {29312#(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:48,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {29312#(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; {29312#(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:48,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {29312#(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; {29312#(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:48,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {29312#(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; {29312#(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:48,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {29312#(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; {29312#(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:48,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {29312#(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; {29313#(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:48,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {29313#(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; {29313#(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:48,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {29313#(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); {29313#(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:48,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {29313#(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; {29313#(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:48,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {29313#(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; {29313#(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:48,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {29313#(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; {29313#(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:48,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {29313#(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; {29313#(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:48,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {29313#(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; {29313#(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:48,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {29313#(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; {29313#(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:48,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {29313#(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; {29313#(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:48,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {29313#(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; {29313#(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:48,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {29313#(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_2403_0~0 := main_~main____CPAchecker_TMP_0~0#1; {29313#(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:48,449 INFO L290 TraceCheckUtils]: 50: Hoare triple {29313#(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_2403_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {29313#(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:48,450 INFO L290 TraceCheckUtils]: 51: Hoare triple {29313#(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; {29313#(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:48,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {29313#(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; {29313#(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:48,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {29313#(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); {29313#(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:48,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {29313#(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; {29314#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:52:48,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {29314#(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; {29315#(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:48,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {29315#(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; {29315#(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:48,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {29315#(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); {29316#(<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0)} is VALID [2022-02-20 18:52:48,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {29316#(<= (+ |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; {29306#false} is VALID [2022-02-20 18:52:48,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {29306#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~2#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29306#false} is VALID [2022-02-20 18:52:48,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {29306#false} assume main_~node4__m4~2#1 != ~nomsg~0; {29306#false} is VALID [2022-02-20 18:52:48,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {29306#false} assume !(main_~node4__m4~2#1 > ~id4~0); {29306#false} is VALID [2022-02-20 18:52:48,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {29306#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; {29306#false} is VALID [2022-02-20 18:52:48,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {29306#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~3#1 := 0;~__return_2505~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_2505~0;~__tmp_1734_0~0 := main_~main____CPAchecker_TMP_0~1#1; {29306#false} is VALID [2022-02-20 18:52:48,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {29306#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1734_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; {29306#false} is VALID [2022-02-20 18:52:48,453 INFO L290 TraceCheckUtils]: 65: Hoare triple {29306#false} assume 0 == main_~assert__arg~13#1 % 256; {29306#false} is VALID [2022-02-20 18:52:48,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {29306#false} assume !false; {29306#false} is VALID [2022-02-20 18:52:48,454 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:48,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:48,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405147176] [2022-02-20 18:52:48,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405147176] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:48,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:48,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:52:48,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8150963] [2022-02-20 18:52:48,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:48,454 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:48,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:48,455 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:48,508 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:48,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:52:48,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:48,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:52:48,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:52:48,508 INFO L87 Difference]: Start difference. First operand 261 states and 314 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:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,139 INFO L93 Difference]: Finished difference Result 473 states and 590 transitions. [2022-02-20 18:52:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:52:52,139 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:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:52,140 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:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 590 transitions. [2022-02-20 18:52:52,143 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:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 590 transitions. [2022-02-20 18:52:52,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 590 transitions. [2022-02-20 18:52:52,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:52,521 INFO L225 Difference]: With dead ends: 473 [2022-02-20 18:52:52,522 INFO L226 Difference]: Without dead ends: 407 [2022-02-20 18:52:52,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:52,522 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 1221 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 2770 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:52,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1221 Valid, 2770 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-02-20 18:52:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 249. [2022-02-20 18:52:53,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:53,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 249 states, 239 states have (on average 1.2552301255230125) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 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:53,351 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 249 states, 239 states have (on average 1.2552301255230125) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 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:53,351 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 249 states, 239 states have (on average 1.2552301255230125) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 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:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:53,357 INFO L93 Difference]: Finished difference Result 407 states and 497 transitions. [2022-02-20 18:52:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 497 transitions. [2022-02-20 18:52:53,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:53,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:53,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 239 states have (on average 1.2552301255230125) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 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 407 states. [2022-02-20 18:52:53,358 INFO L87 Difference]: Start difference. First operand has 249 states, 239 states have (on average 1.2552301255230125) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 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 407 states. [2022-02-20 18:52:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:53,365 INFO L93 Difference]: Finished difference Result 407 states and 497 transitions. [2022-02-20 18:52:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 497 transitions. [2022-02-20 18:52:53,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:53,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:53,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:53,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 239 states have (on average 1.2552301255230125) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 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:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2022-02-20 18:52:53,368 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 67 [2022-02-20 18:52:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:53,369 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2022-02-20 18:52:53,369 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:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2022-02-20 18:52:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:52:53,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:53,369 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:53,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 18:52:53,370 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:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 167509874, now seen corresponding path program 1 times [2022-02-20 18:52:53,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:53,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338482880] [2022-02-20 18:52:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:53,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:53,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {31079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {31079#true} is VALID [2022-02-20 18:52:53,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {31079#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; {31081#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:53,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {31081#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume 0 == ~r1~0; {31081#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:53,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {31081#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume ~id1~0 >= 0; {31082#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:53,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {31082#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume 0 == ~st1~0; {31082#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:53,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {31082#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume ~send1~0 == ~id1~0; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode1~0 % 256; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id2~0 >= 0; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~st2~0; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~send2~0 == ~id2~0; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode2~0 % 256; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id3~0 >= 0; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~st3~0; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~send3~0 == ~id3~0; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode3~0 % 256; {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:53,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {31083#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id4~0 >= 0; {31084#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} is VALID [2022-02-20 18:52:53,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {31084#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} assume 0 == ~st4~0; {31084#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} is VALID [2022-02-20 18:52:53,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {31084#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} assume ~send4~0 == ~id4~0; {31085#(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:53,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {31085#(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; {31085#(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:53,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {31085#(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; {31085#(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:53,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {31085#(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; {31085#(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:53,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {31085#(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; {31086#(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:53,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {31086#(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; {31086#(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:53,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {31086#(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; {31086#(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:53,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {31086#(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; {31086#(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:53,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {31086#(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; {31086#(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:53,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {31086#(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; {31086#(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:53,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {31086#(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; {31086#(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:53,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {31086#(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; {31086#(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:53,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {31086#(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; {31086#(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:53,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {31086#(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; {31086#(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:53,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {31086#(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; {31086#(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:53,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {31086#(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; {31086#(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:53,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {31086#(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; {31086#(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:53,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {31086#(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; {31086#(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:53,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {31086#(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; {31086#(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:53,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {31086#(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; {31086#(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:53,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {31086#(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; {31086#(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:53,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {31086#(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; {31087#(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:53,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {31087#(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; {31087#(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:53,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {31087#(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); {31087#(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:53,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {31087#(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; {31087#(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:53,628 INFO L290 TraceCheckUtils]: 42: Hoare triple {31087#(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; {31087#(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:53,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {31087#(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; {31087#(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:53,629 INFO L290 TraceCheckUtils]: 44: Hoare triple {31087#(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; {31087#(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:53,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {31087#(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; {31088#(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:53,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {31088#(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; {31088#(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:53,630 INFO L290 TraceCheckUtils]: 47: Hoare triple {31088#(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); {31089#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:52:53,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {31089#(<= (+ |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; {31080#false} is VALID [2022-02-20 18:52:53,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {31080#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {31080#false} is VALID [2022-02-20 18:52:53,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {31080#false} assume main_~node2__m2~1#1 != ~nomsg~0; {31080#false} is VALID [2022-02-20 18:52:53,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {31080#false} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {31080#false} is VALID [2022-02-20 18:52:53,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {31080#false} ~mode2~0 := 0; {31080#false} is VALID [2022-02-20 18:52:53,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {31080#false} ~__tmp_1660_0~0 := main_~main____CPAchecker_TMP_0~0#1; {31080#false} is VALID [2022-02-20 18:52:53,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {31080#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1660_0~0;havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {31080#false} is VALID [2022-02-20 18:52:53,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {31080#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {31080#false} is VALID [2022-02-20 18:52:53,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {31080#false} assume main_~node3__m3~11#1 != ~nomsg~0; {31080#false} is VALID [2022-02-20 18:52:53,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {31080#false} assume !(main_~node3__m3~11#1 > ~id3~0); {31080#false} is VALID [2022-02-20 18:52:53,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {31080#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; {31080#false} is VALID [2022-02-20 18:52:53,634 INFO L290 TraceCheckUtils]: 59: Hoare triple {31080#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~13#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {31080#false} is VALID [2022-02-20 18:52:53,634 INFO L290 TraceCheckUtils]: 60: Hoare triple {31080#false} assume main_~node4__m4~13#1 != ~nomsg~0; {31080#false} is VALID [2022-02-20 18:52:53,634 INFO L290 TraceCheckUtils]: 61: Hoare triple {31080#false} assume !(main_~node4__m4~13#1 > ~id4~0); {31080#false} is VALID [2022-02-20 18:52:53,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {31080#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; {31080#false} is VALID [2022-02-20 18:52:53,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {31080#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~17#1 := 0;~__return_1733~0 := main_~check__tmp~17#1;main_~main__c1~0#1 := ~__return_1733~0;~__tmp_1734_0~0 := main_~main____CPAchecker_TMP_0~8#1; {31080#false} is VALID [2022-02-20 18:52:53,635 INFO L290 TraceCheckUtils]: 64: Hoare triple {31080#false} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_1734_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; {31080#false} is VALID [2022-02-20 18:52:53,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {31080#false} assume 0 == main_~assert__arg~13#1 % 256; {31080#false} is VALID [2022-02-20 18:52:53,635 INFO L290 TraceCheckUtils]: 66: Hoare triple {31080#false} assume !false; {31080#false} is VALID [2022-02-20 18:52:53,636 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:53,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:53,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338482880] [2022-02-20 18:52:53,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338482880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:53,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:53,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:52:53,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220846683] [2022-02-20 18:52:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:53,639 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:53,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:53,640 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:53,691 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:53,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:52:53,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:53,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:52:53,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:53,692 INFO L87 Difference]: Start difference. First operand 249 states and 300 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:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:57,740 INFO L93 Difference]: Finished difference Result 701 states and 909 transitions. [2022-02-20 18:52:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:52:57,740 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:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:57,741 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:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 909 transitions. [2022-02-20 18:52:57,747 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:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 909 transitions. [2022-02-20 18:52:57,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 909 transitions. [2022-02-20 18:52:58,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 909 edges. 909 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:58,329 INFO L225 Difference]: With dead ends: 701 [2022-02-20 18:52:58,329 INFO L226 Difference]: Without dead ends: 577 [2022-02-20 18:52:58,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:52:58,330 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 2238 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2238 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:58,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2238 Valid, 1247 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:52:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-02-20 18:52:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 179. [2022-02-20 18:52:58,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:58,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 577 states. Second operand has 179 states, 173 states have (on average 1.2485549132947977) internal successors, (216), 178 states have internal predecessors, (216), 0 states have call successors, (0), 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:58,835 INFO L74 IsIncluded]: Start isIncluded. First operand 577 states. Second operand has 179 states, 173 states have (on average 1.2485549132947977) internal successors, (216), 178 states have internal predecessors, (216), 0 states have call successors, (0), 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:58,835 INFO L87 Difference]: Start difference. First operand 577 states. Second operand has 179 states, 173 states have (on average 1.2485549132947977) internal successors, (216), 178 states have internal predecessors, (216), 0 states have call successors, (0), 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:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:58,848 INFO L93 Difference]: Finished difference Result 577 states and 746 transitions. [2022-02-20 18:52:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 746 transitions. [2022-02-20 18:52:58,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:58,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:58,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 173 states have (on average 1.2485549132947977) internal successors, (216), 178 states have internal predecessors, (216), 0 states have call successors, (0), 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 577 states. [2022-02-20 18:52:58,849 INFO L87 Difference]: Start difference. First operand has 179 states, 173 states have (on average 1.2485549132947977) internal successors, (216), 178 states have internal predecessors, (216), 0 states have call successors, (0), 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 577 states. [2022-02-20 18:52:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:58,861 INFO L93 Difference]: Finished difference Result 577 states and 746 transitions. [2022-02-20 18:52:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 746 transitions. [2022-02-20 18:52:58,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:58,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:58,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:58,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 173 states have (on average 1.2485549132947977) internal successors, (216), 178 states have internal predecessors, (216), 0 states have call successors, (0), 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:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 216 transitions. [2022-02-20 18:52:58,864 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 216 transitions. Word has length 67 [2022-02-20 18:52:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:58,864 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 216 transitions. [2022-02-20 18:52:58,864 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 18:52:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 216 transitions. [2022-02-20 18:52:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:52:58,865 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:58,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:58,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 18:52:58,865 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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:58,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:58,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1968382194, now seen corresponding path program 1 times [2022-02-20 18:52:58,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:58,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440575529] [2022-02-20 18:52:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:58,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:59,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {33429#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {33429#true} is VALID [2022-02-20 18:52:59,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {33429#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; {33431#(<= ~id3~0 127)} is VALID [2022-02-20 18:52:59,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {33431#(<= ~id3~0 127)} assume 0 == ~r1~0; {33431#(<= ~id3~0 127)} is VALID [2022-02-20 18:52:59,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {33431#(<= ~id3~0 127)} assume ~id1~0 >= 0; {33432#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {33432#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~st1~0; {33432#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {33432#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {33433#(and (<= 0 ~id1~0) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} is VALID [2022-02-20 18:52:59,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {33433#(and (<= 0 ~id1~0) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} assume 0 == ~mode1~0 % 256; {33433#(and (<= 0 ~id1~0) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} is VALID [2022-02-20 18:52:59,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {33433#(and (<= 0 ~id1~0) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} assume ~id2~0 >= 0; {33434#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {33434#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {33434#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {33434#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {33434#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {33434#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {33434#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {33434#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {33435#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {33435#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {33435#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {33435#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {33436#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {33436#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {33436#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {33436#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {33437#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id4~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {33437#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id4~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume 0 == ~st4~0; {33437#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id4~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {33437#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id4~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {33438#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (<= 0 ~send3~0) (or (<= ~id3~0 ~id4~0) (<= ~id3~0 ~send3~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; {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~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; {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:59,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {33439#(and (<= 0 ~send4~0) (<= 0 ~id1~0) (<= (+ ~send4~0 ~send3~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (<= 0 ~id2~0) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= 0 ~send3~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; {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:52:59,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:52:59,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} assume ~send2~0 != ~nomsg~0; {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:52:59,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 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; {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:52:59,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:52:59,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} assume ~send3~0 != ~nomsg~0; {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:52:59,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {33440#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= ~send3~0 ~id3~0) (not (<= (+ ~id3~0 1) ~id4~0))) (or (and (<= ~id3~0 ~send3~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0 127)) (<= 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; {33441#(or (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (and (or (and (<= ~id3~0 ~p3_new~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_new~0 ~id3~0))) (<= (+ ~send4~0 ~p3_new~0 129 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0)))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {33441#(or (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (and (or (and (<= ~id3~0 ~p3_new~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_new~0 ~id3~0))) (<= (+ ~send4~0 ~p3_new~0 129 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0)))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {33441#(or (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (and (or (and (<= ~id3~0 ~p3_new~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_new~0 ~id3~0))) (<= (+ ~send4~0 ~p3_new~0 129 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0)))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {33441#(or (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (and (or (and (<= ~id3~0 ~p3_new~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_new~0 ~id3~0))) (<= (+ ~send4~0 ~p3_new~0 129 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0)))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send4~0 != ~nomsg~0; {33441#(or (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (and (or (and (<= ~id3~0 ~p3_new~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_new~0 ~id3~0))) (<= (+ ~send4~0 ~p3_new~0 129 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0)))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {33441#(or (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (and (or (and (<= ~id3~0 ~p3_new~0) (not (<= ~id3~0 ~id4~0))) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_new~0 ~id3~0))) (<= (+ ~send4~0 ~p3_new~0 129 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id2~0)))) (<= (+ ~p1_new~0 1) ~id2~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; {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 >= 4); {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~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; {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,644 INFO L290 TraceCheckUtils]: 43: Hoare triple {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~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; {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {33442#(or (<= (+ ~p3_old~0 ~p4_old~0 129 ~p1_old~0) (+ ~id1~0 ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~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; {33443#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p3_old~0 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id4~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {33443#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p3_old~0 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id4~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {33443#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p3_old~0 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id4~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,647 INFO L290 TraceCheckUtils]: 47: Hoare triple {33443#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p3_old~0 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id4~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {33444#(or (<= (+ ~p3_old~0 ~p1_old~0 130) (+ ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {33444#(or (<= (+ ~p3_old~0 ~p1_old~0 130) (+ ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0; {33444#(or (<= (+ ~p3_old~0 ~p1_old~0 130) (+ ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {33444#(or (<= (+ ~p3_old~0 ~p1_old~0 130) (+ ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p1_old~0 1) ~id2~0))} ~__tmp_2403_0~0 := main_~main____CPAchecker_TMP_0~0#1; {33444#(or (<= (+ ~p3_old~0 ~p1_old~0 130) (+ ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,649 INFO L290 TraceCheckUtils]: 50: Hoare triple {33444#(or (<= (+ ~p3_old~0 ~p1_old~0 130) (+ ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p1_old~0 1) ~id2~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2403_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {33444#(or (<= (+ ~p3_old~0 ~p1_old~0 130) (+ ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:59,649 INFO L290 TraceCheckUtils]: 51: Hoare triple {33444#(or (<= (+ ~p3_old~0 ~p1_old~0 130) (+ ~id4~0 ~id2~0)) (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {33445#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| 130) (+ ~id4~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:52:59,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {33445#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| 130) (+ ~id4~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {33445#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| 130) (+ ~id4~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:52:59,650 INFO L290 TraceCheckUtils]: 53: Hoare triple {33445#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| 130) (+ ~id4~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume main_~node2__m2~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} is VALID [2022-02-20 18:52:59,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} ~mode2~0 := 0; {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} is VALID [2022-02-20 18:52:59,652 INFO L290 TraceCheckUtils]: 55: Hoare triple {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} ~__tmp_1534_0~0 := main_~main____CPAchecker_TMP_0~1#1; {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} is VALID [2022-02-20 18:52:59,652 INFO L290 TraceCheckUtils]: 56: Hoare triple {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_1534_0~0;havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} is VALID [2022-02-20 18:52:59,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} is VALID [2022-02-20 18:52:59,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} assume main_~node3__m3~12#1 != ~nomsg~0; {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} is VALID [2022-02-20 18:52:59,654 INFO L290 TraceCheckUtils]: 59: Hoare triple {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} assume !(main_~node3__m3~12#1 > ~id3~0); {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} is VALID [2022-02-20 18:52:59,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {33446#(or (and (or (and (not (<= ~id3~0 ~id4~0)) (<= ~id3~0 ~p3_old~0)) (<= (+ ~id3~0 1) ~id4~0)) (or (not (<= (+ ~id3~0 1) ~id4~0)) (<= ~p3_old~0 ~id3~0))) (<= (+ 131 ~p3_old~0) ~id4~0))} 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; {33447#(or (<= (+ ~id4~0 1) ~p3_old~0) (<= (+ ~p3_old~0 1) ~id4~0))} is VALID [2022-02-20 18:52:59,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {33447#(or (<= (+ ~id4~0 1) ~p3_old~0) (<= (+ ~p3_old~0 1) ~id4~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~14#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {33448#(or (<= (+ |ULTIMATE.start_main_~node4__m4~14#1| 1) ~id4~0) (<= (+ ~id4~0 1) |ULTIMATE.start_main_~node4__m4~14#1|))} is VALID [2022-02-20 18:52:59,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {33448#(or (<= (+ |ULTIMATE.start_main_~node4__m4~14#1| 1) ~id4~0) (<= (+ ~id4~0 1) |ULTIMATE.start_main_~node4__m4~14#1|))} assume main_~node4__m4~14#1 != ~nomsg~0; {33448#(or (<= (+ |ULTIMATE.start_main_~node4__m4~14#1| 1) ~id4~0) (<= (+ ~id4~0 1) |ULTIMATE.start_main_~node4__m4~14#1|))} is VALID [2022-02-20 18:52:59,655 INFO L290 TraceCheckUtils]: 63: Hoare triple {33448#(or (<= (+ |ULTIMATE.start_main_~node4__m4~14#1| 1) ~id4~0) (<= (+ ~id4~0 1) |ULTIMATE.start_main_~node4__m4~14#1|))} assume !(main_~node4__m4~14#1 > ~id4~0); {33449#(<= (+ |ULTIMATE.start_main_~node4__m4~14#1| 1) ~id4~0)} is VALID [2022-02-20 18:52:59,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {33449#(<= (+ |ULTIMATE.start_main_~node4__m4~14#1| 1) ~id4~0)} 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; {33430#false} is VALID [2022-02-20 18:52:59,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {33430#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~19#1 := 0;~__return_1607~0 := main_~check__tmp~19#1;main_~main__c1~0#1 := ~__return_1607~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; {33430#false} is VALID [2022-02-20 18:52:59,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {33430#false} assume 0 == main_~assert__arg~15#1 % 256; {33430#false} is VALID [2022-02-20 18:52:59,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {33430#false} assume !false; {33430#false} is VALID [2022-02-20 18:52:59,657 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:59,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:59,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440575529] [2022-02-20 18:52:59,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440575529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:59,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:59,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-20 18:52:59,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191705017] [2022-02-20 18:52:59,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:59,657 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:52:59,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:59,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 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:59,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:59,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 18:52:59,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:59,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 18:52:59,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:59,716 INFO L87 Difference]: Start difference. First operand 179 states and 216 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:07,729 INFO L93 Difference]: Finished difference Result 582 states and 734 transitions. [2022-02-20 18:53:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 18:53:07,730 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:53:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 734 transitions. [2022-02-20 18:53:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 734 transitions. [2022-02-20 18:53:07,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 734 transitions. [2022-02-20 18:53:08,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 734 edges. 734 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:08,254 INFO L225 Difference]: With dead ends: 582 [2022-02-20 18:53:08,254 INFO L226 Difference]: Without dead ends: 524 [2022-02-20 18:53:08,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2022-02-20 18:53:08,255 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 2051 mSDsluCounter, 3850 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 4181 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:08,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2051 Valid, 4181 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 18:53:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-02-20 18:53:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 196. [2022-02-20 18:53:09,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:09,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 524 states. Second operand has 196 states, 190 states have (on average 1.2578947368421052) internal successors, (239), 195 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:09,316 INFO L74 IsIncluded]: Start isIncluded. First operand 524 states. Second operand has 196 states, 190 states have (on average 1.2578947368421052) internal successors, (239), 195 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:09,316 INFO L87 Difference]: Start difference. First operand 524 states. Second operand has 196 states, 190 states have (on average 1.2578947368421052) internal successors, (239), 195 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:09,325 INFO L93 Difference]: Finished difference Result 524 states and 650 transitions. [2022-02-20 18:53:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 650 transitions. [2022-02-20 18:53:09,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:09,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:09,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 190 states have (on average 1.2578947368421052) internal successors, (239), 195 states have internal predecessors, (239), 0 states have call successors, (0), 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:53:09,326 INFO L87 Difference]: Start difference. First operand has 196 states, 190 states have (on average 1.2578947368421052) internal successors, (239), 195 states have internal predecessors, (239), 0 states have call successors, (0), 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:53:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:09,335 INFO L93 Difference]: Finished difference Result 524 states and 650 transitions. [2022-02-20 18:53:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 650 transitions. [2022-02-20 18:53:09,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:09,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:09,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:09,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 190 states have (on average 1.2578947368421052) internal successors, (239), 195 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 239 transitions. [2022-02-20 18:53:09,338 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 239 transitions. Word has length 68 [2022-02-20 18:53:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:09,338 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 239 transitions. [2022-02-20 18:53:09,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 239 transitions. [2022-02-20 18:53:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:53:09,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:09,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:09,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 18:53:09,340 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:53:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1424994738, now seen corresponding path program 1 times [2022-02-20 18:53:09,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:09,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169816739] [2022-02-20 18:53:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:09,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {35552#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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_2633_0~0 := 0;~__return_2661~0 := 0;~__return_786~0 := 0;~__tmp_2403_0~0 := 0;~__return_2505~0 := 0;~__return_772~0 := 0;~__tmp_2372_0~0 := 0;~__return_2387~0 := 0;~__return_758~0 := 0;~__tmp_2179_0~0 := 0;~__tmp_2249_0~0 := 0;~__return_2264~0 := 0;~__return_744~0 := 0;~__tmp_2119_0~0 := 0;~__return_2163~0 := 0;~__return_730~0 := 0;~__tmp_1955_0~0 := 0;~__tmp_1996_0~0 := 0;~__return_2040~0 := 0;~__return_716~0 := 0;~__tmp_1907_0~0 := 0;~__tmp_1919_0~0 := 0;~__return_1934~0 := 0;~__return_702~0 := 0;~__tmp_1757_0~0 := 0;~__tmp_1798_0~0 := 0;~__tmp_1810_0~0 := 0;~__return_1828~0 := 0;~__return_688~0 := 0;~__tmp_1660_0~0 := 0;~__return_1733~0 := 0;~__tmp_1734_0~0 := 0;~__return_674~0 := 0;~__tmp_1522_0~0 := 0;~__tmp_1534_0~0 := 0;~__return_1607~0 := 0;~__return_660~0 := 0;~__tmp_1442_0~0 := 0;~__tmp_1483_0~0 := 0;~__return_1498~0 := 0;~__return_646~0 := 0;~__tmp_1321_0~0 := 0;~__tmp_1333_0~0 := 0;~__tmp_1374_0~0 := 0;~__return_1392~0 := 0;~__return_632~0 := 0;~__tmp_1238_0~0 := 0;~__tmp_1250_0~0 := 0;~__return_1294~0 := 0;~__tmp_1303_0~0 := 0;~__return_618~0 := 0;~__tmp_1117_0~0 := 0;~__tmp_1129_0~0 := 0;~__tmp_1141_0~0 := 0;~__return_1188~0 := 0;~__return_604~0 := 0;~__tmp_1054_0~0 := 0;~__tmp_1066_0~0 := 0;~__tmp_1078_0~0 := 0;~__return_1096~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_2666~0 := 0; {35552#true} is VALID [2022-02-20 18:53:09,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {35552#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; {35552#true} is VALID [2022-02-20 18:53:09,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {35552#true} assume 0 == ~r1~0; {35552#true} is VALID [2022-02-20 18:53:09,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {35552#true} assume ~id1~0 >= 0; {35554#(<= 0 ~id1~0)} is VALID [2022-02-20 18:53:09,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {35554#(<= 0 ~id1~0)} assume 0 == ~st1~0; {35554#(<= 0 ~id1~0)} is VALID [2022-02-20 18:53:09,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {35554#(<= 0 ~id1~0)} assume ~send1~0 == ~id1~0; {35555#(and (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {35555#(and (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {35555#(and (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {35555#(and (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {35556#(and (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {35556#(and (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {35556#(and (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {35556#(and (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {35557#(and (<= 0 ~id1~0) (<= ~send2~0 ~id2~0) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {35557#(and (<= 0 ~id1~0) (<= ~send2~0 ~id2~0) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {35557#(and (<= 0 ~id1~0) (<= ~send2~0 ~id2~0) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {35557#(and (<= 0 ~id1~0) (<= ~send2~0 ~id2~0) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {35558#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {35558#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume 0 == ~st3~0; {35558#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {35558#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {35559#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {35559#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {35559#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {35559#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {35560#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id4~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {35560#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id4~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {35560#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id4~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {35560#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id4~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~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; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~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; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:09,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {35561#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~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; {35562#(and (<= 0 ~id3~0) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (or (<= (+ ~send4~0 ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:09,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {35562#(and (<= 0 ~id3~0) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (or (<= (+ ~send4~0 ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {35562#(and (<= 0 ~id3~0) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (or (<= (+ ~send4~0 ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:09,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {35562#(and (<= 0 ~id3~0) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (or (<= (+ ~send4~0 ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {35562#(and (<= 0 ~id3~0) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (or (<= (+ ~send4~0 ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:09,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {35562#(and (<= 0 ~id3~0) (<= 0 ~send4~0) (<= 0 ~id1~0) (<= 0 ~send2~0) (or (<= (+ ~send4~0 ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~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; {35563#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:53:09,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {35563#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= 0 ~send3~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {35563#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:53:09,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {35563#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= 0 ~send3~0)))} assume ~send3~0 != ~nomsg~0; {35563#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:53:09,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {35563#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~send4~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~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; {35564#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (and (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0)))} is VALID [2022-02-20 18:53:09,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {35564#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (and (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {35564#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (and (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0)))} is VALID [2022-02-20 18:53:09,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {35564#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (and (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0)))} assume ~send4~0 != ~nomsg~0; {35564#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (and (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~0)))} is VALID [2022-02-20 18:53:09,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {35564#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (and (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= 0 ~id1~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; {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(~r1~0 >= 4); {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~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; {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~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; {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {35565#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~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; {35566#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:53:09,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {35566#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {35566#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:53:09,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {35566#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {35567#(or (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {35567#(or (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0; {35567#(or (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {35567#(or (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} ~__tmp_2403_0~0 := main_~main____CPAchecker_TMP_0~0#1; {35567#(or (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {35567#(or (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_2403_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {35567#(or (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {35567#(or (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {35568#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {35568#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {35568#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {35568#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {35568#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:09,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {35568#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~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; {35569#(or (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0)))} is VALID [2022-02-20 18:53:09,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {35569#(or (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0)))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {35570#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node3__m3~2#1| 1) (+ ~id4~0 ~id3~0)) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:53:09,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {35570#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node3__m3~2#1| 1) (+ ~id4~0 ~id3~0)) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume main_~node3__m3~2#1 != ~nomsg~0; {35570#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node3__m3~2#1| 1) (+ ~id4~0 ~id3~0)) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:53:09,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {35570#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node3__m3~2#1| 1) (+ ~id4~0 ~id3~0)) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume main_~node3__m3~2#1 > ~id3~0;~send3~0 := main_~node3__m3~2#1; {35571#(<= (+ ~p3_old~0 2) ~id4~0)} is VALID [2022-02-20 18:53:09,893 INFO L290 TraceCheckUtils]: 58: Hoare triple {35571#(<= (+ ~p3_old~0 2) ~id4~0)} ~mode3~0 := 0; {35571#(<= (+ ~p3_old~0 2) ~id4~0)} is VALID [2022-02-20 18:53:09,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {35571#(<= (+ ~p3_old~0 2) ~id4~0)} ~__tmp_1996_0~0 := main_~main____CPAchecker_TMP_0~1#1; {35571#(<= (+ ~p3_old~0 2) ~id4~0)} is VALID [2022-02-20 18:53:09,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {35571#(<= (+ ~p3_old~0 2) ~id4~0)} main_~main____CPAchecker_TMP_0~5#1 := ~__tmp_1996_0~0;havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {35571#(<= (+ ~p3_old~0 2) ~id4~0)} is VALID [2022-02-20 18:53:09,894 INFO L290 TraceCheckUtils]: 61: Hoare triple {35571#(<= (+ ~p3_old~0 2) ~id4~0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {35572#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} is VALID [2022-02-20 18:53:09,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {35572#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} assume main_~node4__m4~8#1 != ~nomsg~0; {35572#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} is VALID [2022-02-20 18:53:09,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {35572#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} assume !(main_~node4__m4~8#1 > ~id4~0); {35572#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} is VALID [2022-02-20 18:53:09,895 INFO L290 TraceCheckUtils]: 64: Hoare triple {35572#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} 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; {35553#false} is VALID [2022-02-20 18:53:09,895 INFO L290 TraceCheckUtils]: 65: Hoare triple {35553#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_2040~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_2040~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; {35553#false} is VALID [2022-02-20 18:53:09,895 INFO L290 TraceCheckUtils]: 66: Hoare triple {35553#false} assume 0 == main_~assert__arg~7#1 % 256; {35553#false} is VALID [2022-02-20 18:53:09,895 INFO L290 TraceCheckUtils]: 67: Hoare triple {35553#false} assume !false; {35553#false} is VALID [2022-02-20 18:53:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:09,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:09,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169816739] [2022-02-20 18:53:09,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169816739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:09,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:09,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-20 18:53:09,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323246432] [2022-02-20 18:53:09,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:53:09,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:09,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:09,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:09,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 18:53:09,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 18:53:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:53:09,949 INFO L87 Difference]: Start difference. First operand 196 states and 239 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)