./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.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.3.ufo.BOUNDED-6.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 f8647b87d9679ff1ae7ce0cdb1a68cb57cbc5ac468f0ecd53079584cb92d51fd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:45,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:45,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:45,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:45,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:45,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:45,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:45,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:45,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:45,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:45,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:45,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:45,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:45,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:45,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:45,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:45,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:45,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:45,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:45,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:45,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:45,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:45,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:45,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:45,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:45,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:45,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:45,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:45,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:45,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:45,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:45,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:45,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:45,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:45,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:45,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:45,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:45,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:45,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:45,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:45,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:45,648 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:50:45,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:45,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:45,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:45,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:45,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:45,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:45,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:45,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:45,663 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:45,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:45,664 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:45,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:45,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:45,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:45,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:45,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:45,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:45,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:45,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:45,665 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:45,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:45,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:45,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:45,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:45,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:45,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:45,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:45,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:45,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:45,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:45,667 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:45,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:45,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:45,667 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 -> f8647b87d9679ff1ae7ce0cdb1a68cb57cbc5ac468f0ecd53079584cb92d51fd [2022-02-20 18:50:45,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:45,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:45,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:45,853 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:45,853 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:45,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2022-02-20 18:50:45,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c615096c/5be639f2406349eebcb69de4190d05e9/FLAG3362ade9d [2022-02-20 18:50:46,301 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:46,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2022-02-20 18:50:46,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c615096c/5be639f2406349eebcb69de4190d05e9/FLAG3362ade9d [2022-02-20 18:50:46,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c615096c/5be639f2406349eebcb69de4190d05e9 [2022-02-20 18:50:46,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:46,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:46,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:46,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:46,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:46,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:46" (1/1) ... [2022-02-20 18:50:46,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ded5198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:46, skipping insertion in model container [2022-02-20 18:50:46,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:46" (1/1) ... [2022-02-20 18:50:46,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:46,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:46,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6197,6210] [2022-02-20 18:50:47,008 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9182,9195] [2022-02-20 18:50:47,071 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12241,12254] [2022-02-20 18:50:47,088 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15128,15141] [2022-02-20 18:50:47,114 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18343,18356] [2022-02-20 18:50:47,139 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21435,21448] [2022-02-20 18:50:47,172 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24486,24499] [2022-02-20 18:50:47,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:47,253 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:47,325 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6197,6210] [2022-02-20 18:50:47,358 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9182,9195] [2022-02-20 18:50:47,363 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12241,12254] [2022-02-20 18:50:47,369 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15128,15141] [2022-02-20 18:50:47,381 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18343,18356] [2022-02-20 18:50:47,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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21435,21448] [2022-02-20 18:50:47,397 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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24486,24499] [2022-02-20 18:50:47,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:47,440 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:47,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47 WrapperNode [2022-02-20 18:50:47,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:47,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:47,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:47,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:47,455 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:50:47" (1/1) ... [2022-02-20 18:50:47,467 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:50:47" (1/1) ... [2022-02-20 18:50:47,532 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1327 [2022-02-20 18:50:47,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:47,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:47,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:47,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:47,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47" (1/1) ... [2022-02-20 18:50:47,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47" (1/1) ... [2022-02-20 18:50:47,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47" (1/1) ... [2022-02-20 18:50:47,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47" (1/1) ... [2022-02-20 18:50:47,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47" (1/1) ... [2022-02-20 18:50:47,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47" (1/1) ... [2022-02-20 18:50:47,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47" (1/1) ... [2022-02-20 18:50:47,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:47,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:47,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:47,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:47,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47" (1/1) ... [2022-02-20 18:50:47,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:47,594 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:50:47,620 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:50:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:47,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:47,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:47,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:47,747 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:47,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:48,596 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:48,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:48,604 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:48,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:48 BoogieIcfgContainer [2022-02-20 18:50:48,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:48,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:48,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:48,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:48,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:46" (1/3) ... [2022-02-20 18:50:48,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac34d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:48, skipping insertion in model container [2022-02-20 18:50:48,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:47" (2/3) ... [2022-02-20 18:50:48,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac34d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:48, skipping insertion in model container [2022-02-20 18:50:48,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:48" (3/3) ... [2022-02-20 18:50:48,614 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2022-02-20 18:50:48,619 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:48,619 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 18:50:48,650 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:48,655 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:50:48,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 18:50:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:48,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:48,681 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] [2022-02-20 18:50:48,681 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:48,685 INFO L85 PathProgramCache]: Analyzing trace with hash -506083603, now seen corresponding path program 1 times [2022-02-20 18:50:48,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:48,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829378217] [2022-02-20 18:50:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:49,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {285#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:49,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {285#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:49,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {285#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {286#(<= (+ ~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;main_~main__i2~0#1 := 0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {286#(<= (+ ~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; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {286#(<= (+ ~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; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:49,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {286#(<= (+ ~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;~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;havoc main_~check__tmp~2#1; {283#false} is VALID [2022-02-20 18:50:49,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {283#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {283#false} is VALID [2022-02-20 18:50:49,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {283#false} assume !(~r1~0 >= 3); {283#false} is VALID [2022-02-20 18:50:49,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {283#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {283#false} is VALID [2022-02-20 18:50:49,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {283#false} assume ~r1~0 < 3;main_~check__tmp~2#1 := 1;~__return_398~0 := main_~check__tmp~2#1;main_~main__c1~0#1 := ~__return_398~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; {283#false} is VALID [2022-02-20 18:50:49,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {283#false} assume !(0 == main_~assert__arg~2#1 % 256);main_~main____CPAchecker_TMP_0~1#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {283#false} is VALID [2022-02-20 18:50:49,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {283#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~2#1;main_~node1__m1~2#1 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:49,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {283#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~2#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:49,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {283#false} assume !(main_~node1__m1~2#1 != ~nomsg~0);~mode1~0 := 0;~__tmp_983_0~0 := main_~main____CPAchecker_TMP_0~1#1; {283#false} is VALID [2022-02-20 18:50:49,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {283#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_983_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:49,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {283#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:49,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {283#false} assume main_~node2__m2~2#1 != ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:49,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {283#false} assume !(main_~node2__m2~2#1 > ~id2~0); {283#false} is VALID [2022-02-20 18:50:49,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {283#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; {283#false} is VALID [2022-02-20 18:50:49,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {283#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:49,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {283#false} assume main_~node3__m3~2#1 != ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:49,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {283#false} assume !(main_~node3__m3~2#1 > ~id3~0); {283#false} is VALID [2022-02-20 18:50:49,048 INFO L290 TraceCheckUtils]: 44: Hoare triple {283#false} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~3#1; {283#false} is VALID [2022-02-20 18:50:49,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {283#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1054~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1054~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; {283#false} is VALID [2022-02-20 18:50:49,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {283#false} assume 0 == main_~assert__arg~3#1 % 256; {283#false} is VALID [2022-02-20 18:50:49,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {283#false} assume !false; {283#false} is VALID [2022-02-20 18:50:49,050 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:50:49,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:49,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829378217] [2022-02-20 18:50:49,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829378217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:49,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:49,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:49,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985621129] [2022-02-20 18:50:49,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:49,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:50:49,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:49,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:49,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:49,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:49,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:49,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:49,124 INFO L87 Difference]: Start difference. First operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 0 states have call successors, (0), 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 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,957 INFO L93 Difference]: Finished difference Result 392 states and 660 transitions. [2022-02-20 18:50:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:50:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2022-02-20 18:50:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2022-02-20 18:50:49,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 660 transitions. [2022-02-20 18:50:50,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 660 edges. 660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:50,435 INFO L225 Difference]: With dead ends: 392 [2022-02-20 18:50:50,435 INFO L226 Difference]: Without dead ends: 244 [2022-02-20 18:50:50,438 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:50:50,441 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1142 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:50,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1142 Valid, 300 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-02-20 18:50:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-02-20 18:50:50,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:50,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 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:50:50,547 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 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:50:50,565 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 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:50:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,572 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2022-02-20 18:50:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2022-02-20 18:50:50,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:50,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:50,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 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 244 states. [2022-02-20 18:50:50,575 INFO L87 Difference]: Start difference. First operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 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 244 states. [2022-02-20 18:50:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,582 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2022-02-20 18:50:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2022-02-20 18:50:50,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:50,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:50,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:50,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 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:50:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 300 transitions. [2022-02-20 18:50:50,591 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 300 transitions. Word has length 48 [2022-02-20 18:50:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:50,592 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 300 transitions. [2022-02-20 18:50:50,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2022-02-20 18:50:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:50,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:50,593 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] [2022-02-20 18:50:50,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:50,594 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1206513712, now seen corresponding path program 1 times [2022-02-20 18:50:50,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:50,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414550547] [2022-02-20 18:50:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:50,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {1560#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {1562#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1563#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:50,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1563#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {1563#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:50,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {1564#(<= (+ ~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;main_~main__i2~0#1 := 0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {1564#(<= (+ ~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; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:50,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {1564#(<= (+ ~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~3#1;main_~node3__m3~3#1 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {1561#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~1#1; {1561#false} is VALID [2022-02-20 18:50:50,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {1561#false} assume ~send3~0 != ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {1561#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~1#1 := ~send3~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;~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;havoc main_~check__tmp~4#1; {1561#false} is VALID [2022-02-20 18:50:50,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {1561#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1561#false} is VALID [2022-02-20 18:50:50,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {1561#false} assume !(~r1~0 >= 3); {1561#false} is VALID [2022-02-20 18:50:50,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {1561#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1561#false} is VALID [2022-02-20 18:50:50,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {1561#false} assume ~r1~0 < 3;main_~check__tmp~4#1 := 1;~__return_384~0 := main_~check__tmp~4#1;main_~main__c1~0#1 := ~__return_384~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; {1561#false} is VALID [2022-02-20 18:50:50,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {1561#false} assume !(0 == main_~assert__arg~4#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; {1561#false} is VALID [2022-02-20 18:50:50,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {1561#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~3#1;main_~node1__m1~3#1 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {1561#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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {1561#false} assume main_~node1__m1~3#1 != ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {1561#false} assume !(main_~node1__m1~3#1 > ~id1~0); {1561#false} is VALID [2022-02-20 18:50:50,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {1561#false} assume main_~node1__m1~3#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {1561#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {1561#false} assume main_~node2__m2~3#1 != ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {1561#false} assume !(main_~node2__m2~3#1 > ~id2~0); {1561#false} is VALID [2022-02-20 18:50:50,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {1561#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {1561#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:50,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {1561#false} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0;~__tmp_949_0~0 := main_~main____CPAchecker_TMP_0~2#1; {1561#false} is VALID [2022-02-20 18:50:50,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {1561#false} main_~main____CPAchecker_TMP_0~2#1 := ~__tmp_949_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;havoc main_~check__tmp~5#1; {1561#false} is VALID [2022-02-20 18:50:50,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {1561#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_962~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_962~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {1561#false} is VALID [2022-02-20 18:50:50,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {1561#false} assume 0 == main_~assert__arg~5#1 % 256; {1561#false} is VALID [2022-02-20 18:50:50,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-02-20 18:50:50,703 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:50:50,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:50,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414550547] [2022-02-20 18:50:50,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414550547] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:50,703 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:50,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:50,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124179836] [2022-02-20 18:50:50,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:50,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:50:50,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:50,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:50,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:50,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:50,737 INFO L87 Difference]: Start difference. First operand 244 states and 300 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,170 INFO L93 Difference]: Finished difference Result 312 states and 387 transitions. [2022-02-20 18:50:51,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:51,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:50:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2022-02-20 18:50:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2022-02-20 18:50:51,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 387 transitions. [2022-02-20 18:50:51,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,460 INFO L225 Difference]: With dead ends: 312 [2022-02-20 18:50:51,460 INFO L226 Difference]: Without dead ends: 186 [2022-02-20 18:50:51,461 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:50:51,461 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 632 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:51,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [632 Valid, 144 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-20 18:50:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-02-20 18:50:51,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:51,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,571 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,572 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,575 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2022-02-20 18:50:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-02-20 18:50:51,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 0 states have call successors, (0), 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 186 states. [2022-02-20 18:50:51,577 INFO L87 Difference]: Start difference. First operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 0 states have call successors, (0), 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 186 states. [2022-02-20 18:50:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,581 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2022-02-20 18:50:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-02-20 18:50:51,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:51,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2022-02-20 18:50:51,586 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 48 [2022-02-20 18:50:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:51,586 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2022-02-20 18:50:51,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-02-20 18:50:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:51,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:51,588 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] [2022-02-20 18:50:51,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:51,588 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:51,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:51,589 INFO L85 PathProgramCache]: Analyzing trace with hash 731649800, now seen corresponding path program 1 times [2022-02-20 18:50:51,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:51,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438324667] [2022-02-20 18:50:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:51,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {2556#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {2558#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {2558#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {2558#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {2558#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2559#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:51,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {2559#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {2559#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:51,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {2559#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {2560#(<= (+ ~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;main_~main__i2~0#1 := 0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:51,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {2560#(<= (+ ~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~5#1;main_~node2__m2~5#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {2557#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~1#1; {2557#false} is VALID [2022-02-20 18:50:51,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {2557#false} assume ~send2~0 != ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {2557#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~6#1;main_~node3__m3~6#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {2557#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {2557#false} is VALID [2022-02-20 18:50:51,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {2557#false} assume ~send3~0 != ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {2557#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~2#1 := ~send3~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;~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;havoc main_~check__tmp~8#1; {2557#false} is VALID [2022-02-20 18:50:51,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {2557#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2557#false} is VALID [2022-02-20 18:50:51,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {2557#false} assume !(~r1~0 >= 3); {2557#false} is VALID [2022-02-20 18:50:51,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {2557#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2557#false} is VALID [2022-02-20 18:50:51,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {2557#false} assume ~r1~0 < 3;main_~check__tmp~8#1 := 1;~__return_356~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_356~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; {2557#false} is VALID [2022-02-20 18:50:51,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {2557#false} assume !(0 == main_~assert__arg~8#1 % 256);main_~main____CPAchecker_TMP_0~4#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {2557#false} is VALID [2022-02-20 18:50:51,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {2557#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~5#1;main_~node1__m1~5#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {2557#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~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {2557#false} assume main_~node1__m1~5#1 != ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {2557#false} assume !(main_~node1__m1~5#1 > ~id1~0); {2557#false} is VALID [2022-02-20 18:50:51,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {2557#false} assume main_~node1__m1~5#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~6#1;main_~node2__m2~6#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {2557#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~6#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {2557#false} assume !(main_~node2__m2~6#1 != ~nomsg~0);~mode2~0 := 0;~__tmp_744_0~0 := main_~main____CPAchecker_TMP_0~4#1; {2557#false} is VALID [2022-02-20 18:50:51,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {2557#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_744_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {2557#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {2557#false} assume main_~node3__m3~7#1 != ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:51,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {2557#false} assume !(main_~node3__m3~7#1 > ~id3~0); {2557#false} is VALID [2022-02-20 18:50:51,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {2557#false} assume main_~node3__m3~7#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~9#1; {2557#false} is VALID [2022-02-20 18:50:51,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {2557#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_786~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_786~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; {2557#false} is VALID [2022-02-20 18:50:51,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {2557#false} assume 0 == main_~assert__arg~9#1 % 256; {2557#false} is VALID [2022-02-20 18:50:51,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {2557#false} assume !false; {2557#false} is VALID [2022-02-20 18:50:51,663 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:50:51,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:51,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438324667] [2022-02-20 18:50:51,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438324667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:51,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:51,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:51,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453832268] [2022-02-20 18:50:51,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:50:51,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:51,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:51,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:51,695 INFO L87 Difference]: Start difference. First operand 186 states and 227 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,120 INFO L93 Difference]: Finished difference Result 266 states and 332 transitions. [2022-02-20 18:50:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:52,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:50:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 332 transitions. [2022-02-20 18:50:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 332 transitions. [2022-02-20 18:50:52,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 332 transitions. [2022-02-20 18:50:52,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:52,332 INFO L225 Difference]: With dead ends: 266 [2022-02-20 18:50:52,332 INFO L226 Difference]: Without dead ends: 163 [2022-02-20 18:50:52,332 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:50:52,333 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 562 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:52,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 127 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-02-20 18:50:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-02-20 18:50:52,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:52,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 163 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,452 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 163 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,452 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 163 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,455 INFO L93 Difference]: Finished difference Result 163 states and 199 transitions. [2022-02-20 18:50:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2022-02-20 18:50:52,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:52,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:52,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 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 163 states. [2022-02-20 18:50:52,457 INFO L87 Difference]: Start difference. First operand has 163 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 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 163 states. [2022-02-20 18:50:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,459 INFO L93 Difference]: Finished difference Result 163 states and 199 transitions. [2022-02-20 18:50:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2022-02-20 18:50:52,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:52,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:52,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:52,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2022-02-20 18:50:52,463 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 48 [2022-02-20 18:50:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:52,464 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2022-02-20 18:50:52,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2022-02-20 18:50:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:52,464 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:52,465 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] [2022-02-20 18:50:52,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:52,465 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:52,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash 613838546, now seen corresponding path program 1 times [2022-02-20 18:50:52,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:52,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604434654] [2022-02-20 18:50:52,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:52,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {3426#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {3428#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:52,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {3428#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {3429#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {3430#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {3430#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {3430#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:52,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {3430#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {3431#(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;main_~main__i2~0#1 := 0; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {3431#(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; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {3431#(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; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {3431#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:52,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {3431#(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;~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;havoc main_~check__tmp~0#1; {3432#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:52,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {3432#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {3432#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:52,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {3432#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 3); {3432#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:52,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {3432#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {3432#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:52,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {3432#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {3432#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:52,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {3432#(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; {3432#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:52,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {3432#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3432#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:52,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {3432#(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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3433#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:50:52,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {3433#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {3427#false} is VALID [2022-02-20 18:50:52,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {3427#false} ~__tmp_983_0~0 := main_~main____CPAchecker_TMP_0~0#1; {3427#false} is VALID [2022-02-20 18:50:52,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {3427#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_983_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:50:52,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {3427#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:50:52,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {3427#false} assume main_~node2__m2~2#1 != ~nomsg~0; {3427#false} is VALID [2022-02-20 18:50:52,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {3427#false} assume !(main_~node2__m2~2#1 > ~id2~0); {3427#false} is VALID [2022-02-20 18:50:52,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {3427#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; {3427#false} is VALID [2022-02-20 18:50:52,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {3427#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:50:52,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {3427#false} assume main_~node3__m3~2#1 != ~nomsg~0; {3427#false} is VALID [2022-02-20 18:50:52,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {3427#false} assume !(main_~node3__m3~2#1 > ~id3~0); {3427#false} is VALID [2022-02-20 18:50:52,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {3427#false} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~3#1; {3427#false} is VALID [2022-02-20 18:50:52,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {3427#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1054~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1054~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; {3427#false} is VALID [2022-02-20 18:50:52,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {3427#false} assume 0 == main_~assert__arg~3#1 % 256; {3427#false} is VALID [2022-02-20 18:50:52,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {3427#false} assume !false; {3427#false} is VALID [2022-02-20 18:50:52,608 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:50:52,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:52,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604434654] [2022-02-20 18:50:52,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604434654] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:52,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:52,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:50:52,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211180226] [2022-02-20 18:50:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:52,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:50:52,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:52,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:52,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:50:52,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:52,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:50:52,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:52,648 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,579 INFO L93 Difference]: Finished difference Result 326 states and 405 transitions. [2022-02-20 18:50:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:50:53,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:50:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 405 transitions. [2022-02-20 18:50:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 405 transitions. [2022-02-20 18:50:53,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 405 transitions. [2022-02-20 18:50:53,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:53,839 INFO L225 Difference]: With dead ends: 326 [2022-02-20 18:50:53,839 INFO L226 Difference]: Without dead ends: 239 [2022-02-20 18:50:53,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:50:53,840 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 708 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:53,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [708 Valid, 311 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-20 18:50:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 163. [2022-02-20 18:50:54,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:54,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 163 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,047 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 163 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,047 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 163 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,052 INFO L93 Difference]: Finished difference Result 239 states and 291 transitions. [2022-02-20 18:50:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 291 transitions. [2022-02-20 18:50:54,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:54,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:54,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 0 states have call successors, (0), 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 239 states. [2022-02-20 18:50:54,053 INFO L87 Difference]: Start difference. First operand has 163 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 0 states have call successors, (0), 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 239 states. [2022-02-20 18:50:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,058 INFO L93 Difference]: Finished difference Result 239 states and 291 transitions. [2022-02-20 18:50:54,058 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 291 transitions. [2022-02-20 18:50:54,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:54,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:54,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:54,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2022-02-20 18:50:54,061 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 50 [2022-02-20 18:50:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:54,062 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2022-02-20 18:50:54,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2022-02-20 18:50:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:54,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:54,063 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] [2022-02-20 18:50:54,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:54,063 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:54,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1717096174, now seen corresponding path program 1 times [2022-02-20 18:50:54,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:54,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836839692] [2022-02-20 18:50:54,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:54,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {4548#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {4550#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:54,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {4550#(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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {4551#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {4552#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {4552#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {4552#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {4552#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {4553#(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;main_~main__i2~0#1 := 0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {4553#(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; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {4553#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:54,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {4553#(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; {4554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:54,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {4554#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:54,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {4554#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {4554#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:54,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {4554#(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;~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;havoc main_~check__tmp~0#1; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {4555#(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; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {4555#(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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {4555#(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; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {4555#(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; {4555#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {4555#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4556#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:50:54,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {4556#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0);~mode3~0 := 0; {4549#false} is VALID [2022-02-20 18:50:54,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {4549#false} ~__tmp_949_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4549#false} is VALID [2022-02-20 18:50:54,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {4549#false} main_~main____CPAchecker_TMP_0~2#1 := ~__tmp_949_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;havoc main_~check__tmp~5#1; {4549#false} is VALID [2022-02-20 18:50:54,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {4549#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_962~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_962~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {4549#false} is VALID [2022-02-20 18:50:54,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {4549#false} assume 0 == main_~assert__arg~5#1 % 256; {4549#false} is VALID [2022-02-20 18:50:54,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {4549#false} assume !false; {4549#false} is VALID [2022-02-20 18:50:54,197 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:50:54,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:54,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836839692] [2022-02-20 18:50:54,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836839692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:54,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:54,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:54,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541100194] [2022-02-20 18:50:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:54,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:50:54,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:54,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:54,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:54,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:54,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:54,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:54,235 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:56,120 INFO L93 Difference]: Finished difference Result 343 states and 441 transitions. [2022-02-20 18:50:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:56,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:50:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 441 transitions. [2022-02-20 18:50:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 441 transitions. [2022-02-20 18:50:56,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 441 transitions. [2022-02-20 18:50:56,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 441 edges. 441 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:56,466 INFO L225 Difference]: With dead ends: 343 [2022-02-20 18:50:56,467 INFO L226 Difference]: Without dead ends: 337 [2022-02-20 18:50:56,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:50:56,467 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 1235 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:56,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 632 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-02-20 18:50:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 163. [2022-02-20 18:50:56,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:56,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 163 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,686 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 163 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,686 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 163 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:56,691 INFO L93 Difference]: Finished difference Result 337 states and 435 transitions. [2022-02-20 18:50:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 435 transitions. [2022-02-20 18:50:56,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:56,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:56,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 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 337 states. [2022-02-20 18:50:56,692 INFO L87 Difference]: Start difference. First operand has 163 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 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 337 states. [2022-02-20 18:50:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:56,697 INFO L93 Difference]: Finished difference Result 337 states and 435 transitions. [2022-02-20 18:50:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 435 transitions. [2022-02-20 18:50:56,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:56,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:56,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:56,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2022-02-20 18:50:56,700 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 197 transitions. Word has length 50 [2022-02-20 18:50:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:56,701 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 197 transitions. [2022-02-20 18:50:56,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 197 transitions. [2022-02-20 18:50:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:56,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:56,701 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] [2022-02-20 18:50:56,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:56,702 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1648014290, now seen corresponding path program 1 times [2022-02-20 18:50:56,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:56,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986327074] [2022-02-20 18:50:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:56,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {5910#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {5912#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:56,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#(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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {5913#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {5913#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {5913#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {5913#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {5914#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {5914#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {5914#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {5914#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:56,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {5915#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5916#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:56,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {5916#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5916#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:56,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {5916#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {5916#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:56,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {5916#(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; {5916#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:56,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {5916#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {5916#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:56,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {5916#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {5916#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:56,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {5916#(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;~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;havoc main_~check__tmp~0#1; {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {5917#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {5917#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {5917#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {5917#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {5917#(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; {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {5917#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {5917#(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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {5917#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {5917#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {5917#(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; {5917#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:56,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {5917#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5918#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:56,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {5918#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {5911#false} is VALID [2022-02-20 18:50:56,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {5911#false} ~__tmp_744_0~0 := main_~main____CPAchecker_TMP_0~0#1; {5911#false} is VALID [2022-02-20 18:50:56,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {5911#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_744_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {5911#false} is VALID [2022-02-20 18:50:56,849 INFO L290 TraceCheckUtils]: 43: Hoare triple {5911#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5911#false} is VALID [2022-02-20 18:50:56,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {5911#false} assume main_~node3__m3~7#1 != ~nomsg~0; {5911#false} is VALID [2022-02-20 18:50:56,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {5911#false} assume !(main_~node3__m3~7#1 > ~id3~0); {5911#false} is VALID [2022-02-20 18:50:56,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {5911#false} assume main_~node3__m3~7#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~9#1; {5911#false} is VALID [2022-02-20 18:50:56,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {5911#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_786~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_786~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; {5911#false} is VALID [2022-02-20 18:50:56,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {5911#false} assume 0 == main_~assert__arg~9#1 % 256; {5911#false} is VALID [2022-02-20 18:50:56,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {5911#false} assume !false; {5911#false} is VALID [2022-02-20 18:50:56,850 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:50:56,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:56,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986327074] [2022-02-20 18:50:56,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986327074] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:56,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:56,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:56,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13354106] [2022-02-20 18:50:56,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:50:56,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:56,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:56,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:56,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:56,895 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,210 INFO L93 Difference]: Finished difference Result 403 states and 525 transitions. [2022-02-20 18:50:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:59,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:50:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 525 transitions. [2022-02-20 18:50:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 525 transitions. [2022-02-20 18:50:59,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 525 transitions. [2022-02-20 18:50:59,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:59,604 INFO L225 Difference]: With dead ends: 403 [2022-02-20 18:50:59,604 INFO L226 Difference]: Without dead ends: 341 [2022-02-20 18:50:59,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:50:59,605 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 1232 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:59,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1232 Valid, 826 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:50:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-02-20 18:50:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 163. [2022-02-20 18:50:59,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:59,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 163 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,858 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 163 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,858 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 163 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,863 INFO L93 Difference]: Finished difference Result 341 states and 440 transitions. [2022-02-20 18:50:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 440 transitions. [2022-02-20 18:50:59,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:59,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:59,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 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 341 states. [2022-02-20 18:50:59,864 INFO L87 Difference]: Start difference. First operand has 163 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 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 341 states. [2022-02-20 18:50:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,869 INFO L93 Difference]: Finished difference Result 341 states and 440 transitions. [2022-02-20 18:50:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 440 transitions. [2022-02-20 18:50:59,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:59,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:59,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:59,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2022-02-20 18:50:59,872 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 50 [2022-02-20 18:50:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:59,873 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2022-02-20 18:50:59,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2022-02-20 18:50:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:50:59,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:59,873 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] [2022-02-20 18:50:59,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:59,874 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:59,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1708755507, now seen corresponding path program 1 times [2022-02-20 18:50:59,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:59,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767462568] [2022-02-20 18:50:59,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:00,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {7358#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {7358#true} is VALID [2022-02-20 18:51:00,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {7358#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {7360#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {7360#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {7360#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {7360#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {7361#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:00,300 INFO L290 TraceCheckUtils]: 4: Hoare triple {7361#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {7361#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:00,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {7362#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {7362#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode1~0 % 256; {7362#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {7362#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 >= 0; {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st2~0; {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send2~0 == ~id2~0; {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode2~0 % 256; {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id3~0 >= 0; {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st3~0; {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send3~0 == ~id3~0; {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode3~0 % 256; {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {7363#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id2~0; {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id3~0; {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~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;main_~main__i2~0#1 := 0; {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send1~0 != ~nomsg~0; {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:00,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {7364#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~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; {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~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; {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send3~0 != ~nomsg~0; {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {7365#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~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;~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;havoc main_~check__tmp~0#1; {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 >= 3); {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~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; {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {7366#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~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; {7367#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {7367#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7368#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:00,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {7368#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume main_~node2__m2~1#1 != ~nomsg~0; {7368#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:00,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {7368#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 > ~id2~0); {7369#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:00,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {7369#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~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; {7359#false} is VALID [2022-02-20 18:51:00,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {7359#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7359#false} is VALID [2022-02-20 18:51:00,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {7359#false} assume main_~node3__m3~1#1 != ~nomsg~0; {7359#false} is VALID [2022-02-20 18:51:00,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {7359#false} assume !(main_~node3__m3~1#1 > ~id3~0); {7359#false} is VALID [2022-02-20 18:51:00,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {7359#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~1#1; {7359#false} is VALID [2022-02-20 18:51:00,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {7359#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1163~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1163~0;~__tmp_1164_0~0 := main_~main____CPAchecker_TMP_0~0#1; {7359#false} is VALID [2022-02-20 18:51:00,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {7359#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1164_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {7359#false} is VALID [2022-02-20 18:51:00,339 INFO L290 TraceCheckUtils]: 49: Hoare triple {7359#false} assume 0 == main_~assert__arg~1#1 % 256; {7359#false} is VALID [2022-02-20 18:51:00,339 INFO L290 TraceCheckUtils]: 50: Hoare triple {7359#false} assume !false; {7359#false} is VALID [2022-02-20 18:51:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:00,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:00,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767462568] [2022-02-20 18:51:00,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767462568] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:00,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:00,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:00,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226574218] [2022-02-20 18:51:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:00,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:51:00,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:00,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:00,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:00,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:00,381 INFO L87 Difference]: Start difference. First operand 163 states and 196 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:04,005 INFO L93 Difference]: Finished difference Result 486 states and 647 transitions. [2022-02-20 18:51:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:51:04,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:51:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 647 transitions. [2022-02-20 18:51:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 647 transitions. [2022-02-20 18:51:04,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 647 transitions. [2022-02-20 18:51:04,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 647 edges. 647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:04,538 INFO L225 Difference]: With dead ends: 486 [2022-02-20 18:51:04,538 INFO L226 Difference]: Without dead ends: 431 [2022-02-20 18:51:04,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:51:04,539 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 1552 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:04,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1552 Valid, 1733 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-02-20 18:51:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 151. [2022-02-20 18:51:04,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:04,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 431 states. Second operand has 151 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 150 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,959 INFO L74 IsIncluded]: Start isIncluded. First operand 431 states. Second operand has 151 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 150 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,960 INFO L87 Difference]: Start difference. First operand 431 states. Second operand has 151 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 150 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:04,967 INFO L93 Difference]: Finished difference Result 431 states and 570 transitions. [2022-02-20 18:51:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 570 transitions. [2022-02-20 18:51:04,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:04,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:04,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 150 states have internal predecessors, (182), 0 states have call successors, (0), 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 431 states. [2022-02-20 18:51:04,969 INFO L87 Difference]: Start difference. First operand has 151 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 150 states have internal predecessors, (182), 0 states have call successors, (0), 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 431 states. [2022-02-20 18:51:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:04,976 INFO L93 Difference]: Finished difference Result 431 states and 570 transitions. [2022-02-20 18:51:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 570 transitions. [2022-02-20 18:51:04,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:04,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:04,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:04,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 150 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 182 transitions. [2022-02-20 18:51:04,980 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 182 transitions. Word has length 51 [2022-02-20 18:51:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:04,980 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 182 transitions. [2022-02-20 18:51:04,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 182 transitions. [2022-02-20 18:51:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:51:04,981 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:04,981 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] [2022-02-20 18:51:04,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:51:04,981 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 871420535, now seen corresponding path program 1 times [2022-02-20 18:51:04,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:04,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410814286] [2022-02-20 18:51:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:04,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:05,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {9087#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {9087#true} is VALID [2022-02-20 18:51:05,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {9087#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {9089#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {9089#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {9089#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {9089#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {9090#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:05,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {9090#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {9090#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:05,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {9090#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {9091#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} is VALID [2022-02-20 18:51:05,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {9091#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} assume 0 == ~mode1~0 % 256; {9091#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} is VALID [2022-02-20 18:51:05,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {9091#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} assume ~id2~0 >= 0; {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:05,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~st2~0; {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:05,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:05,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:05,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:05,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:05,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:05,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~mode3~0 % 256; {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:05,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {9092#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~id1~0 != ~id2~0; {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:05,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~id1~0 != ~id3~0; {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:05,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:05,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~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;main_~main__i2~0#1 := 0; {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:05,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:05,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:05,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~send1~0 != ~nomsg~0; {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:05,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {9093#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~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; {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:05,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:05,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:05,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~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; {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:05,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:05,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:05,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {9094#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~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;~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;havoc main_~check__tmp~0#1; {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 >= 3); {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~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; {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {9095#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {9096#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {9096#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0; {9096#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {9096#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~__tmp_983_0~0 := main_~main____CPAchecker_TMP_0~0#1; {9096#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {9096#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_983_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {9096#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:05,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {9096#(or (<= (+ ~id2~0 1) ~p1_old~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; {9097#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:05,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {9097#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {9097#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:05,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {9097#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {9098#(<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:05,277 INFO L290 TraceCheckUtils]: 44: Hoare triple {9098#(<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~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; {9088#false} is VALID [2022-02-20 18:51:05,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {9088#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9088#false} is VALID [2022-02-20 18:51:05,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {9088#false} assume main_~node3__m3~2#1 != ~nomsg~0; {9088#false} is VALID [2022-02-20 18:51:05,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {9088#false} assume !(main_~node3__m3~2#1 > ~id3~0); {9088#false} is VALID [2022-02-20 18:51:05,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {9088#false} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~3#1; {9088#false} is VALID [2022-02-20 18:51:05,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {9088#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1054~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1054~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; {9088#false} is VALID [2022-02-20 18:51:05,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {9088#false} assume 0 == main_~assert__arg~3#1 % 256; {9088#false} is VALID [2022-02-20 18:51:05,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {9088#false} assume !false; {9088#false} is VALID [2022-02-20 18:51:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:05,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:05,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410814286] [2022-02-20 18:51:05,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410814286] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:05,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:05,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:05,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945439051] [2022-02-20 18:51:05,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:51:05,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:05,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:05,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:05,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:05,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:05,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:05,338 INFO L87 Difference]: Start difference. First operand 151 states and 182 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,479 INFO L93 Difference]: Finished difference Result 436 states and 576 transitions. [2022-02-20 18:51:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:51:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:51:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 576 transitions. [2022-02-20 18:51:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 576 transitions. [2022-02-20 18:51:09,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 576 transitions. [2022-02-20 18:51:09,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:09,951 INFO L225 Difference]: With dead ends: 436 [2022-02-20 18:51:09,952 INFO L226 Difference]: Without dead ends: 419 [2022-02-20 18:51:09,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:51:09,953 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 951 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:09,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [951 Valid, 2150 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-02-20 18:51:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 134. [2022-02-20 18:51:10,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:10,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 134 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:10,258 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 134 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:10,259 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 134 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:10,298 INFO L93 Difference]: Finished difference Result 419 states and 556 transitions. [2022-02-20 18:51:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 556 transitions. [2022-02-20 18:51:10,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:10,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:10,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 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 419 states. [2022-02-20 18:51:10,299 INFO L87 Difference]: Start difference. First operand has 134 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 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 419 states. [2022-02-20 18:51:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:10,308 INFO L93 Difference]: Finished difference Result 419 states and 556 transitions. [2022-02-20 18:51:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 556 transitions. [2022-02-20 18:51:10,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:10,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:10,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:10,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2022-02-20 18:51:10,325 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 52 [2022-02-20 18:51:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:10,325 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2022-02-20 18:51:10,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2022-02-20 18:51:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:51:10,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:10,327 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] [2022-02-20 18:51:10,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:51:10,327 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:10,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1375412663, now seen corresponding path program 1 times [2022-02-20 18:51:10,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:10,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542461005] [2022-02-20 18:51:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:10,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:10,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {10705#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {10705#true} is VALID [2022-02-20 18:51:10,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {10705#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:10,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:10,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:10,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:10,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:10,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:10,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {10707#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {10708#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:10,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {10708#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {10708#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:10,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {10708#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {10709#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:10,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {10709#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode2~0 % 256; {10709#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:10,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {10709#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id3~0 >= 0; {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:10,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~st3~0; {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:10,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~send3~0 == ~id3~0; {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:10,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode3~0 % 256; {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:10,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id2~0; {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:10,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id3~0; {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:10,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {10710#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:10,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~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;main_~main__i2~0#1 := 0; {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:10,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:10,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:10,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~send1~0 != ~nomsg~0; {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:10,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~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; {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:10,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:10,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~send2~0 != ~nomsg~0; {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:10,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {10711#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~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; {10712#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:10,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {10712#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10712#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:10,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {10712#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {10712#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:10,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {10712#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~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;~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;havoc main_~check__tmp~0#1; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(~r1~0 >= 3); {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~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; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 != ~nomsg~0; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node1__m1~1#1 > ~id1~0); {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~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; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~1#1 != ~nomsg~0; {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:10,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {10713#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {10714#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:10,628 INFO L290 TraceCheckUtils]: 42: Hoare triple {10714#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {10714#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:10,628 INFO L290 TraceCheckUtils]: 43: Hoare triple {10714#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~__tmp_744_0~0 := main_~main____CPAchecker_TMP_0~0#1; {10714#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:10,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {10714#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_744_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {10714#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:10,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {10714#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10715#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:51:10,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {10715#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~7#1|))} assume main_~node3__m3~7#1 != ~nomsg~0; {10715#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:51:10,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {10715#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~7#1|))} assume !(main_~node3__m3~7#1 > ~id3~0); {10716#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:10,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {10716#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} assume main_~node3__m3~7#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~9#1; {10706#false} is VALID [2022-02-20 18:51:10,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {10706#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_786~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_786~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; {10706#false} is VALID [2022-02-20 18:51:10,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {10706#false} assume 0 == main_~assert__arg~9#1 % 256; {10706#false} is VALID [2022-02-20 18:51:10,630 INFO L290 TraceCheckUtils]: 51: Hoare triple {10706#false} assume !false; {10706#false} is VALID [2022-02-20 18:51:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:10,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:10,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542461005] [2022-02-20 18:51:10,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542461005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:10,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:10,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:10,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194749893] [2022-02-20 18:51:10,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:10,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:51:10,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:10,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:10,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:10,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:10,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:10,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:10,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:10,673 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:12,528 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2022-02-20 18:51:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:51:12,528 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:51:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 346 transitions. [2022-02-20 18:51:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 346 transitions. [2022-02-20 18:51:12,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 346 transitions. [2022-02-20 18:51:12,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:12,748 INFO L225 Difference]: With dead ends: 275 [2022-02-20 18:51:12,748 INFO L226 Difference]: Without dead ends: 228 [2022-02-20 18:51:12,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:51:12,749 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 911 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:12,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [911 Valid, 944 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-02-20 18:51:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2022-02-20 18:51:13,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:13,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 130 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 129 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,209 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 130 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 129 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,209 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 130 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 129 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:13,212 INFO L93 Difference]: Finished difference Result 228 states and 277 transitions. [2022-02-20 18:51:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 277 transitions. [2022-02-20 18:51:13,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:13,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:13,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 129 states have internal predecessors, (158), 0 states have call successors, (0), 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 228 states. [2022-02-20 18:51:13,213 INFO L87 Difference]: Start difference. First operand has 130 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 129 states have internal predecessors, (158), 0 states have call successors, (0), 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 228 states. [2022-02-20 18:51:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:13,216 INFO L93 Difference]: Finished difference Result 228 states and 277 transitions. [2022-02-20 18:51:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 277 transitions. [2022-02-20 18:51:13,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:13,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:13,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:13,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 129 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2022-02-20 18:51:13,219 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 52 [2022-02-20 18:51:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:13,219 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2022-02-20 18:51:13,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2022-02-20 18:51:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:13,220 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:13,220 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] [2022-02-20 18:51:13,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:13,221 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:13,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash 4832631, now seen corresponding path program 1 times [2022-02-20 18:51:13,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:13,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347480541] [2022-02-20 18:51:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:13,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {11719#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {11721#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:13,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {11721#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {11722#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {11722#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {11722#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {11722#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {11723#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {11723#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {11723#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {11723#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~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;main_~main__i2~0#1 := 0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:13,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {11724#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~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; {11725#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:13,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {11725#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11725#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:13,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {11725#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {11725#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:13,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {11725#(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; {11725#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:13,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {11725#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11725#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:13,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {11725#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {11725#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:13,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {11725#(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;~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;havoc main_~check__tmp~0#1; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {11726#(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; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {11726#(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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} ~__tmp_983_0~0 := main_~main____CPAchecker_TMP_0~0#1; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_983_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {11726#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:13,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {11726#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11727#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} is VALID [2022-02-20 18:51:13,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {11727#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} assume !(main_~node2__m2~2#1 != ~nomsg~0);~mode2~0 := 0; {11720#false} is VALID [2022-02-20 18:51:13,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {11720#false} ~__tmp_649_0~0 := main_~main____CPAchecker_TMP_0~1#1; {11720#false} is VALID [2022-02-20 18:51:13,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {11720#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_649_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {11720#false} is VALID [2022-02-20 18:51:13,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {11720#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11720#false} is VALID [2022-02-20 18:51:13,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {11720#false} assume main_~node3__m3~8#1 != ~nomsg~0; {11720#false} is VALID [2022-02-20 18:51:13,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {11720#false} assume !(main_~node3__m3~8#1 > ~id3~0); {11720#false} is VALID [2022-02-20 18:51:13,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {11720#false} assume main_~node3__m3~8#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~11#1; {11720#false} is VALID [2022-02-20 18:51:13,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {11720#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11720#false} is VALID [2022-02-20 18:51:13,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {11720#false} assume !(~r1~0 >= 3); {11720#false} is VALID [2022-02-20 18:51:13,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {11720#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~11#1 := 0;~__return_694~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_694~0;havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~11#1;main_~assert__arg~11#1 := main_~__tmp_12~0#1; {11720#false} is VALID [2022-02-20 18:51:13,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {11720#false} assume 0 == main_~assert__arg~11#1 % 256; {11720#false} is VALID [2022-02-20 18:51:13,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {11720#false} assume !false; {11720#false} is VALID [2022-02-20 18:51:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:13,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:13,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347480541] [2022-02-20 18:51:13,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347480541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:13,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:13,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:13,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785395447] [2022-02-20 18:51:13,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:13,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:51:13,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:13,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:13,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:13,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:13,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:13,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:13,392 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:14,912 INFO L93 Difference]: Finished difference Result 266 states and 340 transitions. [2022-02-20 18:51:14,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:51:14,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:51:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 340 transitions. [2022-02-20 18:51:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 340 transitions. [2022-02-20 18:51:14,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 340 transitions. [2022-02-20 18:51:15,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:15,104 INFO L225 Difference]: With dead ends: 266 [2022-02-20 18:51:15,104 INFO L226 Difference]: Without dead ends: 203 [2022-02-20 18:51:15,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:51:15,105 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 520 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:15,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 502 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-02-20 18:51:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2022-02-20 18:51:15,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:15,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 130 states, 127 states have (on average 1.236220472440945) internal successors, (157), 129 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,437 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 130 states, 127 states have (on average 1.236220472440945) internal successors, (157), 129 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,438 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 130 states, 127 states have (on average 1.236220472440945) internal successors, (157), 129 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:15,452 INFO L93 Difference]: Finished difference Result 203 states and 253 transitions. [2022-02-20 18:51:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2022-02-20 18:51:15,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:15,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:15,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 127 states have (on average 1.236220472440945) internal successors, (157), 129 states have internal predecessors, (157), 0 states have call successors, (0), 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 203 states. [2022-02-20 18:51:15,453 INFO L87 Difference]: Start difference. First operand has 130 states, 127 states have (on average 1.236220472440945) internal successors, (157), 129 states have internal predecessors, (157), 0 states have call successors, (0), 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 203 states. [2022-02-20 18:51:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:15,456 INFO L93 Difference]: Finished difference Result 203 states and 253 transitions. [2022-02-20 18:51:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2022-02-20 18:51:15,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:15,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:15,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:15,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 127 states have (on average 1.236220472440945) internal successors, (157), 129 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 157 transitions. [2022-02-20 18:51:15,459 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 157 transitions. Word has length 54 [2022-02-20 18:51:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:15,459 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 157 transitions. [2022-02-20 18:51:15,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 157 transitions. [2022-02-20 18:51:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:15,459 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:15,460 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] [2022-02-20 18:51:15,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:51:15,460 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash -924533993, now seen corresponding path program 1 times [2022-02-20 18:51:15,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:15,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469126847] [2022-02-20 18:51:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:15,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {12668#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {12670#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:15,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {12670#(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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {12671#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {12672#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {12672#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {12672#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {12672#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:15,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {12673#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12674#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:15,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {12674#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12674#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:15,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {12674#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {12674#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:15,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {12674#(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;~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;havoc main_~check__tmp~0#1; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {12675#(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; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {12675#(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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {12675#(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; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,576 INFO L290 TraceCheckUtils]: 41: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} ~__tmp_744_0~0 := main_~main____CPAchecker_TMP_0~0#1; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_744_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {12675#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:15,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {12675#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12676#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:51:15,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {12676#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~7#1|))} assume !(main_~node3__m3~7#1 != ~nomsg~0);~mode3~0 := 0; {12669#false} is VALID [2022-02-20 18:51:15,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {12669#false} ~__tmp_600_0~0 := main_~main____CPAchecker_TMP_0~4#1; {12669#false} is VALID [2022-02-20 18:51:15,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {12669#false} main_~main____CPAchecker_TMP_0~7#1 := ~__tmp_600_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;havoc main_~check__tmp~13#1; {12669#false} is VALID [2022-02-20 18:51:15,582 INFO L290 TraceCheckUtils]: 49: Hoare triple {12669#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12669#false} is VALID [2022-02-20 18:51:15,582 INFO L290 TraceCheckUtils]: 50: Hoare triple {12669#false} assume !(~r1~0 >= 3); {12669#false} is VALID [2022-02-20 18:51:15,582 INFO L290 TraceCheckUtils]: 51: Hoare triple {12669#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~13#1 := 0;~__return_616~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_616~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; {12669#false} is VALID [2022-02-20 18:51:15,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {12669#false} assume 0 == main_~assert__arg~13#1 % 256; {12669#false} is VALID [2022-02-20 18:51:15,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {12669#false} assume !false; {12669#false} is VALID [2022-02-20 18:51:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:15,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:15,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469126847] [2022-02-20 18:51:15,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469126847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:15,583 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:15,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:15,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045619415] [2022-02-20 18:51:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:15,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:51:15,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:15,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:15,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:15,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:15,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:15,620 INFO L87 Difference]: Start difference. First operand 130 states and 157 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:16,993 INFO L93 Difference]: Finished difference Result 220 states and 269 transitions. [2022-02-20 18:51:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:51:16,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:51:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 269 transitions. [2022-02-20 18:51:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 269 transitions. [2022-02-20 18:51:16,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 269 transitions. [2022-02-20 18:51:17,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:17,166 INFO L225 Difference]: With dead ends: 220 [2022-02-20 18:51:17,166 INFO L226 Difference]: Without dead ends: 212 [2022-02-20 18:51:17,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:17,167 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 492 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:17,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 707 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-02-20 18:51:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 130. [2022-02-20 18:51:17,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:17,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 130 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,570 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 130 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,571 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 130 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:17,573 INFO L93 Difference]: Finished difference Result 212 states and 260 transitions. [2022-02-20 18:51:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 260 transitions. [2022-02-20 18:51:17,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:17,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:17,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 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 212 states. [2022-02-20 18:51:17,574 INFO L87 Difference]: Start difference. First operand has 130 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 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 212 states. [2022-02-20 18:51:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:17,577 INFO L93 Difference]: Finished difference Result 212 states and 260 transitions. [2022-02-20 18:51:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 260 transitions. [2022-02-20 18:51:17,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:17,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:17,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:17,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2022-02-20 18:51:17,579 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 54 [2022-02-20 18:51:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:17,579 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2022-02-20 18:51:17,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2022-02-20 18:51:17,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:51:17,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:17,580 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] [2022-02-20 18:51:17,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:17,580 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:17,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1614885916, now seen corresponding path program 1 times [2022-02-20 18:51:17,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:17,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277538822] [2022-02-20 18:51:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:17,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {13570#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {13570#true} is VALID [2022-02-20 18:51:17,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {13570#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {13572#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:17,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {13572#(<= ~id3~0 127)} assume 0 == ~r1~0; {13572#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:17,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {13572#(<= ~id3~0 127)} assume ~id1~0 >= 0; {13573#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:17,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {13573#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~st1~0; {13573#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:17,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {13573#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {13574#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {13574#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {13574#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {13574#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {13575#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {13575#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {13575#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {13575#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {13576#(and (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {13576#(and (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {13576#(and (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {13576#(and (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {13577#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {13577#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {13577#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {13577#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 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;main_~main__i2~0#1 := 0; {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:17,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {13578#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 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; {13579#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:17,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {13579#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13579#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:17,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {13579#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {13579#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:17,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {13579#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~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; {13580#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:17,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {13580#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0)) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13580#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:17,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {13580#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0)) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {13580#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:17,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {13580#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~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;~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;havoc main_~check__tmp~0#1; {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:17,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:17,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 >= 3); {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:17,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:17,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:17,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~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; {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:17,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:17,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {13581#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13582#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {13582#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {13582#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {13582#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {13583#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {13583#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0; {13583#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {13583#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~__tmp_983_0~0 := main_~main____CPAchecker_TMP_0~0#1; {13583#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {13583#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_983_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {13583#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {13583#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~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; {13584#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {13584#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {13584#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {13584#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {13585#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {13585#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {13585#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {13585#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~__tmp_649_0~0 := main_~main____CPAchecker_TMP_0~1#1; {13585#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {13585#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_649_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {13585#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:17,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {13585#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13586#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:17,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {13586#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} assume main_~node3__m3~8#1 != ~nomsg~0; {13586#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:17,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {13586#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} assume !(main_~node3__m3~8#1 > ~id3~0); {13587#(<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:17,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {13587#(<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0)} assume main_~node3__m3~8#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~11#1; {13571#false} is VALID [2022-02-20 18:51:17,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {13571#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13571#false} is VALID [2022-02-20 18:51:17,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {13571#false} assume !(~r1~0 >= 3); {13571#false} is VALID [2022-02-20 18:51:17,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {13571#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~11#1 := 0;~__return_694~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_694~0;havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~11#1;main_~assert__arg~11#1 := main_~__tmp_12~0#1; {13571#false} is VALID [2022-02-20 18:51:17,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {13571#false} assume 0 == main_~assert__arg~11#1 % 256; {13571#false} is VALID [2022-02-20 18:51:17,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {13571#false} assume !false; {13571#false} is VALID [2022-02-20 18:51:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:17,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:17,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277538822] [2022-02-20 18:51:17,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277538822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:17,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:17,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:17,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194329867] [2022-02-20 18:51:17,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:51:17,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:17,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:18,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:18,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:18,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:18,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:18,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:18,041 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:24,009 INFO L93 Difference]: Finished difference Result 456 states and 588 transitions. [2022-02-20 18:51:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 18:51:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:51:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 588 transitions. [2022-02-20 18:51:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 588 transitions. [2022-02-20 18:51:24,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 588 transitions. [2022-02-20 18:51:24,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:24,509 INFO L225 Difference]: With dead ends: 456 [2022-02-20 18:51:24,509 INFO L226 Difference]: Without dead ends: 450 [2022-02-20 18:51:24,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2022-02-20 18:51:24,510 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 1191 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:24,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1191 Valid, 2999 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 18:51:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-02-20 18:51:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 143. [2022-02-20 18:51:25,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:25,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand has 143 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 142 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,109 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand has 143 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 142 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,110 INFO L87 Difference]: Start difference. First operand 450 states. Second operand has 143 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 142 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,117 INFO L93 Difference]: Finished difference Result 450 states and 582 transitions. [2022-02-20 18:51:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 582 transitions. [2022-02-20 18:51:25,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:25,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:25,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 142 states have internal predecessors, (172), 0 states have call successors, (0), 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 450 states. [2022-02-20 18:51:25,118 INFO L87 Difference]: Start difference. First operand has 143 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 142 states have internal predecessors, (172), 0 states have call successors, (0), 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 450 states. [2022-02-20 18:51:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,125 INFO L93 Difference]: Finished difference Result 450 states and 582 transitions. [2022-02-20 18:51:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 582 transitions. [2022-02-20 18:51:25,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:25,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:25,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:25,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 142 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 172 transitions. [2022-02-20 18:51:25,128 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 172 transitions. Word has length 56 [2022-02-20 18:51:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:25,129 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 172 transitions. [2022-02-20 18:51:25,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2022-02-20 18:51:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:51:25,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:25,129 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] [2022-02-20 18:51:25,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:25,130 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash -712982628, now seen corresponding path program 1 times [2022-02-20 18:51:25,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:25,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552561933] [2022-02-20 18:51:25,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:25,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {15308#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {15308#true} is VALID [2022-02-20 18:51:25,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {15308#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {15310#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:25,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {15310#(<= ~send1~0 127)} assume 0 == ~r1~0; {15310#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:25,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {15310#(<= ~send1~0 127)} assume ~id1~0 >= 0; {15311#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:25,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {15311#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume 0 == ~st1~0; {15311#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:25,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {15311#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume ~send1~0 == ~id1~0; {15312#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {15312#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {15312#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {15312#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {15313#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {15313#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {15313#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {15313#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {15314#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {15314#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {15314#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {15314#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {15315#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {15315#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {15315#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {15315#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~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;main_~main__i2~0#1 := 0; {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:25,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {15316#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~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; {15317#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:25,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {15317#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15317#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:25,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {15317#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {15317#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:25,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {15317#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~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; {15318#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:51:25,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {15318#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15318#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:51:25,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {15318#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} assume ~send3~0 != ~nomsg~0; {15318#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:51:25,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {15318#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~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;~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;havoc main_~check__tmp~0#1; {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:25,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:25,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 >= 3); {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:25,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:25,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:25,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~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; {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:25,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:25,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {15319#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15320#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:25,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {15320#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {15320#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:25,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {15320#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {15321#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:25,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {15321#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~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; {15322#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:25,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {15322#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15323#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:25,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {15323#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {15323#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:25,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {15323#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {15324#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:25,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {15324#(<= (+ ~p2_old~0 1) ~id3~0)} ~mode2~0 := 0; {15324#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:25,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {15324#(<= (+ ~p2_old~0 1) ~id3~0)} ~__tmp_744_0~0 := main_~main____CPAchecker_TMP_0~0#1; {15324#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:25,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {15324#(<= (+ ~p2_old~0 1) ~id3~0)} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_744_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {15324#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:25,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {15324#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15325#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:25,532 INFO L290 TraceCheckUtils]: 46: Hoare triple {15325#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} assume main_~node3__m3~7#1 != ~nomsg~0; {15325#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:25,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {15325#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} assume main_~node3__m3~7#1 > ~id3~0;~send3~0 := main_~node3__m3~7#1; {15309#false} is VALID [2022-02-20 18:51:25,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {15309#false} ~mode3~0 := 0; {15309#false} is VALID [2022-02-20 18:51:25,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {15309#false} ~__tmp_600_0~0 := main_~main____CPAchecker_TMP_0~4#1; {15309#false} is VALID [2022-02-20 18:51:25,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {15309#false} main_~main____CPAchecker_TMP_0~7#1 := ~__tmp_600_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;havoc main_~check__tmp~13#1; {15309#false} is VALID [2022-02-20 18:51:25,533 INFO L290 TraceCheckUtils]: 51: Hoare triple {15309#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15309#false} is VALID [2022-02-20 18:51:25,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {15309#false} assume !(~r1~0 >= 3); {15309#false} is VALID [2022-02-20 18:51:25,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {15309#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~13#1 := 0;~__return_616~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_616~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; {15309#false} is VALID [2022-02-20 18:51:25,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {15309#false} assume 0 == main_~assert__arg~13#1 % 256; {15309#false} is VALID [2022-02-20 18:51:25,533 INFO L290 TraceCheckUtils]: 55: Hoare triple {15309#false} assume !false; {15309#false} is VALID [2022-02-20 18:51:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:25,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:25,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552561933] [2022-02-20 18:51:25,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552561933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:25,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:25,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:25,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478330317] [2022-02-20 18:51:25,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:25,535 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:51:25,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:25,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:25,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:25,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:25,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:25,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:25,586 INFO L87 Difference]: Start difference. First operand 143 states and 172 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:31,299 INFO L93 Difference]: Finished difference Result 357 states and 448 transitions. [2022-02-20 18:51:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:51:31,299 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:51:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 439 transitions. [2022-02-20 18:51:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 439 transitions. [2022-02-20 18:51:31,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 439 transitions. [2022-02-20 18:51:31,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:31,516 INFO L225 Difference]: With dead ends: 357 [2022-02-20 18:51:31,516 INFO L226 Difference]: Without dead ends: 348 [2022-02-20 18:51:31,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2022-02-20 18:51:31,517 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 873 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:31,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [873 Valid, 2667 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 18:51:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-02-20 18:51:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 149. [2022-02-20 18:51:31,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:31,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 149 states, 146 states have (on average 1.2191780821917808) internal successors, (178), 148 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,998 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 149 states, 146 states have (on average 1.2191780821917808) internal successors, (178), 148 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,999 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 149 states, 146 states have (on average 1.2191780821917808) internal successors, (178), 148 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:32,003 INFO L93 Difference]: Finished difference Result 348 states and 439 transitions. [2022-02-20 18:51:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 439 transitions. [2022-02-20 18:51:32,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:32,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:32,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 146 states have (on average 1.2191780821917808) internal successors, (178), 148 states have internal predecessors, (178), 0 states have call successors, (0), 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 348 states. [2022-02-20 18:51:32,008 INFO L87 Difference]: Start difference. First operand has 149 states, 146 states have (on average 1.2191780821917808) internal successors, (178), 148 states have internal predecessors, (178), 0 states have call successors, (0), 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 348 states. [2022-02-20 18:51:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:32,012 INFO L93 Difference]: Finished difference Result 348 states and 439 transitions. [2022-02-20 18:51:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 439 transitions. [2022-02-20 18:51:32,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:32,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:32,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:32,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 146 states have (on average 1.2191780821917808) internal successors, (178), 148 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 178 transitions. [2022-02-20 18:51:32,015 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 178 transitions. Word has length 56 [2022-02-20 18:51:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:32,016 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 178 transitions. [2022-02-20 18:51:32,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 178 transitions. [2022-02-20 18:51:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:51:32,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:32,017 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] [2022-02-20 18:51:32,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:51:32,017 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:32,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:32,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1229531537, now seen corresponding path program 1 times [2022-02-20 18:51:32,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:32,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887845477] [2022-02-20 18:51:32,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:32,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:32,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {16713#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {16713#true} is VALID [2022-02-20 18:51:32,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {16713#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:32,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} assume 0 == ~r1~0; {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:32,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:32,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} assume 0 == ~st1~0; {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:32,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:32,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:32,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {16715#(or (<= ~id2~0 ~id3~0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {16716#(and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 127)) (or (not (<= ~id2~0 ~id3~0)) (<= 0 ~id2~0)))} is VALID [2022-02-20 18:51:32,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {16716#(and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 127)) (or (not (<= ~id2~0 ~id3~0)) (<= 0 ~id2~0)))} assume 0 == ~st2~0; {16716#(and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 127)) (or (not (<= ~id2~0 ~id3~0)) (<= 0 ~id2~0)))} is VALID [2022-02-20 18:51:32,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {16716#(and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 127)) (or (not (<= ~id2~0 ~id3~0)) (<= 0 ~id2~0)))} assume ~send2~0 == ~id2~0; {16717#(and (or (and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (or (and (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {16717#(and (or (and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (or (and (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} assume 0 == ~mode2~0 % 256; {16717#(and (or (and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (or (and (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {16717#(and (or (and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (or (and (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} assume ~id3~0 >= 0; {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:32,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~st3~0; {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:32,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~send3~0 == ~id3~0; {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:32,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode3~0 % 256; {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:32,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id2~0; {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:32,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id3~0; {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:32,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {16718#(and (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~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;main_~main__i2~0#1 := 0; {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} assume ~send1~0 != ~nomsg~0; {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~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; {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} assume ~send2~0 != ~nomsg~0; {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)))} is VALID [2022-02-20 18:51:32,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {16719#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (and (<= 0 ~id3~0) (<= ~send2~0 127) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~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; {16720#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} is VALID [2022-02-20 18:51:32,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {16720#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16720#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} is VALID [2022-02-20 18:51:32,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {16720#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} assume ~send3~0 != ~nomsg~0; {16720#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} is VALID [2022-02-20 18:51:32,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {16720#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~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;~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;havoc main_~check__tmp~0#1; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(~r1~0 >= 3); {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~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; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 != ~nomsg~0; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} ~mode1~0 := 0; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} ~__tmp_983_0~0 := main_~main____CPAchecker_TMP_0~0#1; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_983_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~2#1 != ~nomsg~0; {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node2__m2~2#1 > ~id2~0); {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:32,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {16721#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node2__m2~2#1 == ~id2~0); {16722#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {16722#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {16722#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {16722#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~__tmp_649_0~0 := main_~main____CPAchecker_TMP_0~1#1; {16722#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {16722#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_649_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {16722#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {16722#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16723#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:32,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {16723#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} assume main_~node3__m3~8#1 != ~nomsg~0; {16723#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:32,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {16723#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} assume !(main_~node3__m3~8#1 > ~id3~0); {16724#(<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:32,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {16724#(<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0)} assume main_~node3__m3~8#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~11#1; {16714#false} is VALID [2022-02-20 18:51:32,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {16714#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16714#false} is VALID [2022-02-20 18:51:32,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {16714#false} assume !(~r1~0 >= 3); {16714#false} is VALID [2022-02-20 18:51:32,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {16714#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~11#1 := 0;~__return_694~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_694~0;havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~11#1;main_~assert__arg~11#1 := main_~__tmp_12~0#1; {16714#false} is VALID [2022-02-20 18:51:32,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {16714#false} assume 0 == main_~assert__arg~11#1 % 256; {16714#false} is VALID [2022-02-20 18:51:32,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {16714#false} assume !false; {16714#false} is VALID [2022-02-20 18:51:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:32,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:32,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887845477] [2022-02-20 18:51:32,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887845477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:32,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:32,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:32,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645569605] [2022-02-20 18:51:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:32,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:51:32,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:32,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:32,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:32,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:32,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:32,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:32,350 INFO L87 Difference]: Start difference. First operand 149 states and 178 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:35,104 INFO L93 Difference]: Finished difference Result 319 states and 410 transitions. [2022-02-20 18:51:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:51:35,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:51:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 394 transitions. [2022-02-20 18:51:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 394 transitions. [2022-02-20 18:51:35,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 394 transitions. [2022-02-20 18:51:35,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:35,332 INFO L225 Difference]: With dead ends: 319 [2022-02-20 18:51:35,332 INFO L226 Difference]: Without dead ends: 313 [2022-02-20 18:51:35,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:35,334 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 692 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:35,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 1542 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-02-20 18:51:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 130. [2022-02-20 18:51:35,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:35,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 130 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,749 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 130 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,749 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 130 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:35,753 INFO L93 Difference]: Finished difference Result 313 states and 403 transitions. [2022-02-20 18:51:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 403 transitions. [2022-02-20 18:51:35,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:35,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:35,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 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 313 states. [2022-02-20 18:51:35,767 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 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 313 states. [2022-02-20 18:51:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:35,779 INFO L93 Difference]: Finished difference Result 313 states and 403 transitions. [2022-02-20 18:51:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 403 transitions. [2022-02-20 18:51:35,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:35,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:35,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:35,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2022-02-20 18:51:35,782 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 57 [2022-02-20 18:51:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:35,782 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2022-02-20 18:51:35,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2022-02-20 18:51:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:51:35,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:35,783 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] [2022-02-20 18:51:35,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:51:35,783 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1082760790, now seen corresponding path program 1 times [2022-02-20 18:51:35,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:35,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094120101] [2022-02-20 18:51:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:36,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {17963#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {17963#true} is VALID [2022-02-20 18:51:36,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {17963#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {17965#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:36,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {17965#(<= ~id3~0 127)} assume 0 == ~r1~0; {17965#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:36,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {17965#(<= ~id3~0 127)} assume ~id1~0 >= 0; {17966#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:36,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {17966#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~st1~0; {17966#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:36,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {17966#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {17967#(and (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:36,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {17967#(and (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} assume 0 == ~mode1~0 % 256; {17967#(and (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:36,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {17967#(and (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} assume ~id2~0 >= 0; {17968#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {17968#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {17968#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {17968#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {17968#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {17968#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {17968#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {17968#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {17969#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {17969#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {17969#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {17969#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {17970#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {17970#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {17970#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {17970#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {17970#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {17970#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~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;main_~main__i2~0#1 := 0; {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume ~send1~0 != ~nomsg~0; {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {17971#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~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; {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume ~send2~0 != ~nomsg~0; {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~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; {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume ~send3~0 != ~nomsg~0; {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:36,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {17972#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~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;~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;havoc main_~check__tmp~0#1; {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume !(~r1~0 >= 3); {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~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; {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {17973#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {17974#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~id1~0 ~id3~0) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0))) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {17974#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~id1~0 ~id3~0) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0))) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {17974#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~id1~0 ~id3~0) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0))) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {17974#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~id1~0 ~id3~0) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0))) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {17975#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (not (<= ~id1~0 ~id3~0)) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0)) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:36,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {17975#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (not (<= ~id1~0 ~id3~0)) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0)) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~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; {17976#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:51:36,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {17976#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:36,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {17977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 != ~nomsg~0; {17977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:36,163 INFO L290 TraceCheckUtils]: 41: Hoare triple {17977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {17964#false} is VALID [2022-02-20 18:51:36,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {17964#false} ~mode2~0 := 0; {17964#false} is VALID [2022-02-20 18:51:36,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {17964#false} ~__tmp_744_0~0 := main_~main____CPAchecker_TMP_0~0#1; {17964#false} is VALID [2022-02-20 18:51:36,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {17964#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_744_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {17964#false} is VALID [2022-02-20 18:51:36,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {17964#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17964#false} is VALID [2022-02-20 18:51:36,163 INFO L290 TraceCheckUtils]: 46: Hoare triple {17964#false} assume main_~node3__m3~7#1 != ~nomsg~0; {17964#false} is VALID [2022-02-20 18:51:36,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {17964#false} assume !(main_~node3__m3~7#1 > ~id3~0); {17964#false} is VALID [2022-02-20 18:51:36,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {17964#false} assume !(main_~node3__m3~7#1 == ~id3~0); {17964#false} is VALID [2022-02-20 18:51:36,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {17964#false} ~mode3~0 := 0; {17964#false} is VALID [2022-02-20 18:51:36,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {17964#false} ~__tmp_600_0~0 := main_~main____CPAchecker_TMP_0~4#1; {17964#false} is VALID [2022-02-20 18:51:36,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {17964#false} main_~main____CPAchecker_TMP_0~7#1 := ~__tmp_600_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;havoc main_~check__tmp~13#1; {17964#false} is VALID [2022-02-20 18:51:36,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {17964#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17964#false} is VALID [2022-02-20 18:51:36,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {17964#false} assume !(~r1~0 >= 3); {17964#false} is VALID [2022-02-20 18:51:36,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {17964#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~13#1 := 0;~__return_616~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_616~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; {17964#false} is VALID [2022-02-20 18:51:36,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {17964#false} assume 0 == main_~assert__arg~13#1 % 256; {17964#false} is VALID [2022-02-20 18:51:36,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {17964#false} assume !false; {17964#false} is VALID [2022-02-20 18:51:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:36,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:36,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094120101] [2022-02-20 18:51:36,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094120101] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:36,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:36,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 18:51:36,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990804021] [2022-02-20 18:51:36,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:36,166 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:51:36,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:36,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:36,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 18:51:36,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 18:51:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:51:36,198 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,287 INFO L93 Difference]: Finished difference Result 265 states and 332 transitions. [2022-02-20 18:51:39,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 18:51:39,288 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:51:39,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 332 transitions. [2022-02-20 18:51:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 332 transitions. [2022-02-20 18:51:39,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 332 transitions. [2022-02-20 18:51:39,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:39,469 INFO L225 Difference]: With dead ends: 265 [2022-02-20 18:51:39,470 INFO L226 Difference]: Without dead ends: 249 [2022-02-20 18:51:39,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-02-20 18:51:39,472 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 1024 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:39,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 1405 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-02-20 18:51:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 124. [2022-02-20 18:51:39,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:39,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 124 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,926 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 124 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,926 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 124 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,929 INFO L93 Difference]: Finished difference Result 249 states and 316 transitions. [2022-02-20 18:51:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 316 transitions. [2022-02-20 18:51:39,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:39,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:39,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 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 249 states. [2022-02-20 18:51:39,930 INFO L87 Difference]: Start difference. First operand has 124 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 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 249 states. [2022-02-20 18:51:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,933 INFO L93 Difference]: Finished difference Result 249 states and 316 transitions. [2022-02-20 18:51:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 316 transitions. [2022-02-20 18:51:39,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:39,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:39,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:39,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2022-02-20 18:51:39,939 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 57 [2022-02-20 18:51:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:39,939 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2022-02-20 18:51:39,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2022-02-20 18:51:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:51:39,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:39,940 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] [2022-02-20 18:51:39,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 18:51:39,941 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:39,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1556324125, now seen corresponding path program 1 times [2022-02-20 18:51:39,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:39,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50846479] [2022-02-20 18:51:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:40,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {19013#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {19013#true} is VALID [2022-02-20 18:51:40,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {19013#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {19015#(and (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:51:40,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {19015#(and (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} assume 0 == ~r1~0; {19015#(and (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:51:40,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {19015#(and (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} assume ~id1~0 >= 0; {19016#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:51:40,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {19016#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} assume 0 == ~st1~0; {19016#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:51:40,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {19016#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} assume ~send1~0 == ~id1~0; {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:40,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume 0 == ~mode1~0 % 256; {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:40,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume ~id2~0 >= 0; {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:40,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume 0 == ~st2~0; {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:40,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume ~send2~0 == ~id2~0; {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:40,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume 0 == ~mode2~0 % 256; {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:40,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {19017#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume ~id3~0 >= 0; {19018#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} is VALID [2022-02-20 18:51:40,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {19018#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} assume 0 == ~st3~0; {19018#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} is VALID [2022-02-20 18:51:40,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {19018#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} assume ~send3~0 == ~id3~0; {19019#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {19019#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume 0 == ~mode3~0 % 256; {19019#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {19019#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~id1~0 != ~id2~0; {19019#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {19019#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~id1~0 != ~id3~0; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~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;main_~main__i2~0#1 := 0; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~send1~0 != ~nomsg~0; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~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; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~send2~0 != ~nomsg~0; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~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; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~send3~0 != ~nomsg~0; {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:40,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {19020#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~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;~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;havoc main_~check__tmp~0#1; {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:40,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:40,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume !(~r1~0 >= 3); {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:40,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:40,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:40,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_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; {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:40,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:40,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {19021#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19022#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:40,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {19022#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} assume main_~node1__m1~1#1 != ~nomsg~0; {19022#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:40,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {19022#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 > ~id1~0); {19023#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {19023#(<= (+ |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; {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {19014#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {19014#false} assume main_~node2__m2~1#1 != ~nomsg~0; {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {19014#false} assume !(main_~node2__m2~1#1 > ~id2~0); {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {19014#false} assume !(main_~node2__m2~1#1 == ~id2~0); {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {19014#false} ~mode2~0 := 0; {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {19014#false} ~__tmp_744_0~0 := main_~main____CPAchecker_TMP_0~0#1; {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {19014#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_744_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {19014#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {19014#false} assume main_~node3__m3~7#1 != ~nomsg~0; {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {19014#false} assume main_~node3__m3~7#1 > ~id3~0;~send3~0 := main_~node3__m3~7#1; {19014#false} is VALID [2022-02-20 18:51:40,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {19014#false} ~mode3~0 := 0; {19014#false} is VALID [2022-02-20 18:51:40,199 INFO L290 TraceCheckUtils]: 50: Hoare triple {19014#false} ~__tmp_600_0~0 := main_~main____CPAchecker_TMP_0~4#1; {19014#false} is VALID [2022-02-20 18:51:40,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {19014#false} main_~main____CPAchecker_TMP_0~7#1 := ~__tmp_600_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;havoc main_~check__tmp~13#1; {19014#false} is VALID [2022-02-20 18:51:40,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {19014#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19014#false} is VALID [2022-02-20 18:51:40,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {19014#false} assume !(~r1~0 >= 3); {19014#false} is VALID [2022-02-20 18:51:40,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {19014#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~13#1 := 0;~__return_616~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_616~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; {19014#false} is VALID [2022-02-20 18:51:40,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {19014#false} assume 0 == main_~assert__arg~13#1 % 256; {19014#false} is VALID [2022-02-20 18:51:40,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {19014#false} assume !false; {19014#false} is VALID [2022-02-20 18:51:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:40,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:40,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50846479] [2022-02-20 18:51:40,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50846479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:40,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:40,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:51:40,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216927389] [2022-02-20 18:51:40,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:40,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:51:40,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:40,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:40,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:51:40,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:40,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:51:40,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:51:40,242 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:43,990 INFO L93 Difference]: Finished difference Result 377 states and 505 transitions. [2022-02-20 18:51:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:51:43,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:51:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 505 transitions. [2022-02-20 18:51:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 505 transitions. [2022-02-20 18:51:43,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 505 transitions. [2022-02-20 18:51:44,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:44,306 INFO L225 Difference]: With dead ends: 377 [2022-02-20 18:51:44,306 INFO L226 Difference]: Without dead ends: 357 [2022-02-20 18:51:44,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:51:44,311 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 1274 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:44,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1274 Valid, 716 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-02-20 18:51:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 104. [2022-02-20 18:51:44,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:44,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 104 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,695 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 104 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,695 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 104 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,699 INFO L93 Difference]: Finished difference Result 357 states and 484 transitions. [2022-02-20 18:51:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 484 transitions. [2022-02-20 18:51:44,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 357 states. [2022-02-20 18:51:44,708 INFO L87 Difference]: Start difference. First operand has 104 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 357 states. [2022-02-20 18:51:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,713 INFO L93 Difference]: Finished difference Result 357 states and 484 transitions. [2022-02-20 18:51:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 484 transitions. [2022-02-20 18:51:44,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:44,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2022-02-20 18:51:44,715 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 57 [2022-02-20 18:51:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:44,715 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2022-02-20 18:51:44,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2022-02-20 18:51:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:51:44,716 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:44,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:44,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 18:51:44,716 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:44,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1117882514, now seen corresponding path program 1 times [2022-02-20 18:51:44,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:44,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620932144] [2022-02-20 18:51:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:44,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {20404#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {20404#true} is VALID [2022-02-20 18:51:44,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {20404#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {20404#true} is VALID [2022-02-20 18:51:44,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {20404#true} assume 0 == ~r1~0; {20404#true} is VALID [2022-02-20 18:51:44,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {20404#true} assume ~id1~0 >= 0; {20404#true} is VALID [2022-02-20 18:51:44,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {20404#true} assume 0 == ~st1~0; {20406#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:44,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {20406#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {20406#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:44,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {20406#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {20406#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:44,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {20406#(<= ~st1~0 0)} assume ~id2~0 >= 0; {20406#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:44,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {20406#(<= ~st1~0 0)} assume 0 == ~st2~0; {20407#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {20407#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {20407#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {20407#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {20407#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {20407#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {20407#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {20407#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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;main_~main__i2~0#1 := 0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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;~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;havoc main_~check__tmp~0#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__tmp_983_0~0 := main_~main____CPAchecker_TMP_0~0#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_983_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 != ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__tmp_649_0~0 := main_~main____CPAchecker_TMP_0~1#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_649_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__tmp_516_0~0 := main_~main____CPAchecker_TMP_0~6#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_516_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;havoc main_~check__tmp~15#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~15#1 := 1;~__return_535~0 := main_~check__tmp~15#1;main_~main__c1~0#1 := ~__return_535~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; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~15#1 % 256);main_~main____CPAchecker_TMP_0~9#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_544_0~0 := main_~main____CPAchecker_TMP_0~9#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_544_0~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~9#1;main_~node1__m1~9#1 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~9#1 != ~nomsg~0); {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~10#1;main_~node2__m2~10#1 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~10#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~10#1 != ~nomsg~0); {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~12#1 != ~nomsg~0); {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~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;havoc main_~check__tmp~16#1; {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,824 INFO L290 TraceCheckUtils]: 70: Hoare triple {20408#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~16#1 := 0; {20405#false} is VALID [2022-02-20 18:51:44,825 INFO L290 TraceCheckUtils]: 71: Hoare triple {20405#false} ~__return_1310~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1310~0;~__tmp_1164_0~0 := main_~main____CPAchecker_TMP_0~9#1; {20405#false} is VALID [2022-02-20 18:51:44,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {20405#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1164_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {20405#false} is VALID [2022-02-20 18:51:44,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {20405#false} assume 0 == main_~assert__arg~1#1 % 256; {20405#false} is VALID [2022-02-20 18:51:44,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {20405#false} assume !false; {20405#false} is VALID [2022-02-20 18:51:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:44,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:44,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620932144] [2022-02-20 18:51:44,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620932144] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:44,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:44,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:44,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655724002] [2022-02-20 18:51:44,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:44,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:51:44,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:44,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:44,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:44,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:44,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:44,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:44,878 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:47,684 INFO L93 Difference]: Finished difference Result 362 states and 506 transitions. [2022-02-20 18:51:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:51:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:51:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 506 transitions. [2022-02-20 18:51:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 506 transitions. [2022-02-20 18:51:47,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 506 transitions. [2022-02-20 18:51:47,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 506 edges. 506 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:47,995 INFO L225 Difference]: With dead ends: 362 [2022-02-20 18:51:47,995 INFO L226 Difference]: Without dead ends: 319 [2022-02-20 18:51:47,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:51:47,995 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 526 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:47,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 457 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-02-20 18:51:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 145. [2022-02-20 18:51:48,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:48,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 145 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:48,878 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 145 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:48,879 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 145 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:48,882 INFO L93 Difference]: Finished difference Result 319 states and 437 transitions. [2022-02-20 18:51:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 437 transitions. [2022-02-20 18:51:48,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:48,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:48,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 0 states have call successors, (0), 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 319 states. [2022-02-20 18:51:48,883 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 0 states have call successors, (0), 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 319 states. [2022-02-20 18:51:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:48,887 INFO L93 Difference]: Finished difference Result 319 states and 437 transitions. [2022-02-20 18:51:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 437 transitions. [2022-02-20 18:51:48,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:48,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:48,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:48,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2022-02-20 18:51:48,889 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 75 [2022-02-20 18:51:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:48,890 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2022-02-20 18:51:48,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2022-02-20 18:51:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:51:48,890 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:48,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:48,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 18:51:48,891 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:48,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1016465065, now seen corresponding path program 1 times [2022-02-20 18:51:48,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:48,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336194959] [2022-02-20 18:51:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:48,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {21734#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {21734#true} is VALID [2022-02-20 18:51:48,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {21734#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {21734#true} is VALID [2022-02-20 18:51:48,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {21734#true} assume 0 == ~r1~0; {21734#true} is VALID [2022-02-20 18:51:48,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {21734#true} assume ~id1~0 >= 0; {21734#true} is VALID [2022-02-20 18:51:48,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {21734#true} assume 0 == ~st1~0; {21736#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:48,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {21736#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {21736#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:48,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {21736#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {21736#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:48,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {21736#(<= ~st1~0 0)} assume ~id2~0 >= 0; {21736#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:48,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {21736#(<= ~st1~0 0)} assume 0 == ~st2~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 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;main_~main__i2~0#1 := 0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 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; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 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; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 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;~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;havoc main_~check__tmp~0#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 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; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} ~__tmp_983_0~0 := main_~main____CPAchecker_TMP_0~0#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_983_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 != ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} ~__tmp_649_0~0 := main_~main____CPAchecker_TMP_0~1#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_649_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} ~__tmp_516_0~0 := main_~main____CPAchecker_TMP_0~6#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_516_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;havoc main_~check__tmp~15#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~15#1 := 1;~__return_535~0 := main_~check__tmp~15#1;main_~main__c1~0#1 := ~__return_535~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; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~15#1 % 256);main_~main____CPAchecker_TMP_0~9#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_544_0~0 := main_~main____CPAchecker_TMP_0~9#1; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_544_0~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~9#1;main_~node1__m1~9#1 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 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~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~9#1 != ~nomsg~0); {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~10#1;main_~node2__m2~10#1 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~10#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~10#1 != ~nomsg~0); {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,966 INFO L290 TraceCheckUtils]: 64: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~12#1 != ~nomsg~0; {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~12#1 > ~id3~0); {21737#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:48,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {21737#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~12#1 == ~id3~0;~st3~0 := 1; {21738#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:48,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {21738#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {21738#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:48,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {21738#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~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;havoc main_~check__tmp~16#1; {21738#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:48,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {21738#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~16#1 := 0; {21735#false} is VALID [2022-02-20 18:51:48,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {21735#false} ~__return_1310~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1310~0;~__tmp_1164_0~0 := main_~main____CPAchecker_TMP_0~9#1; {21735#false} is VALID [2022-02-20 18:51:48,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {21735#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1164_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {21735#false} is VALID [2022-02-20 18:51:48,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {21735#false} assume 0 == main_~assert__arg~1#1 % 256; {21735#false} is VALID [2022-02-20 18:51:48,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {21735#false} assume !false; {21735#false} is VALID [2022-02-20 18:51:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:48,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:48,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336194959] [2022-02-20 18:51:48,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336194959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:48,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:48,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:48,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570598852] [2022-02-20 18:51:48,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:48,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:51:48,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:48,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:49,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:49,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:49,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:49,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:49,019 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:51,337 INFO L93 Difference]: Finished difference Result 440 states and 618 transitions. [2022-02-20 18:51:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:51,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:51:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:51:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:51:51,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 378 transitions. [2022-02-20 18:51:51,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 378 edges. 378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:51,489 INFO L225 Difference]: With dead ends: 440 [2022-02-20 18:51:51,489 INFO L226 Difference]: Without dead ends: 356 [2022-02-20 18:51:51,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:51,490 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 292 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:51,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 417 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-02-20 18:51:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 227. [2022-02-20 18:51:53,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:53,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand has 227 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:53,902 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand has 227 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:53,902 INFO L87 Difference]: Start difference. First operand 356 states. Second operand has 227 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:53,906 INFO L93 Difference]: Finished difference Result 356 states and 494 transitions. [2022-02-20 18:51:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 494 transitions. [2022-02-20 18:51:53,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:53,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:53,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 0 states have call successors, (0), 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 356 states. [2022-02-20 18:51:53,907 INFO L87 Difference]: Start difference. First operand has 227 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 0 states have call successors, (0), 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 356 states. [2022-02-20 18:51:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:53,912 INFO L93 Difference]: Finished difference Result 356 states and 494 transitions. [2022-02-20 18:51:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 494 transitions. [2022-02-20 18:51:53,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:53,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:53,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:53,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 309 transitions. [2022-02-20 18:51:53,917 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 309 transitions. Word has length 77 [2022-02-20 18:51:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:53,918 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 309 transitions. [2022-02-20 18:51:53,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 309 transitions. [2022-02-20 18:51:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:51:53,928 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:53,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:53,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 18:51:53,929 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:53,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1101947074, now seen corresponding path program 1 times [2022-02-20 18:51:53,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:53,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097974249] [2022-02-20 18:51:53,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:53,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:53,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {23364#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;~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];~__return_94~0 := 0;~__return_412~0 := 0;~__return_1163~0 := 0;~__tmp_1164_0~0 := 0;~__return_398~0 := 0;~__tmp_983_0~0 := 0;~__return_1054~0 := 0;~__return_384~0 := 0;~__tmp_949_0~0 := 0;~__return_962~0 := 0;~__return_370~0 := 0;~__tmp_813_0~0 := 0;~__tmp_854_0~0 := 0;~__return_870~0 := 0;~__return_356~0 := 0;~__tmp_744_0~0 := 0;~__return_786~0 := 0;~__tmp_795_0~0 := 0;~__return_342~0 := 0;~__tmp_637_0~0 := 0;~__tmp_649_0~0 := 0;~__return_694~0 := 0;~__return_328~0 := 0;~__tmp_588_0~0 := 0;~__tmp_600_0~0 := 0;~__return_616~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1310~0 := 0;~__return_1176~0 := 0; {23364#true} is VALID [2022-02-20 18:51:53,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {23364#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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;havoc main_~init__tmp~0#1; {23364#true} is VALID [2022-02-20 18:51:53,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {23364#true} assume 0 == ~r1~0; {23364#true} is VALID [2022-02-20 18:51:53,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {23364#true} assume ~id1~0 >= 0; {23364#true} is VALID [2022-02-20 18:51:53,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {23364#true} assume 0 == ~st1~0; {23364#true} is VALID [2022-02-20 18:51:53,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {23364#true} assume ~send1~0 == ~id1~0; {23364#true} is VALID [2022-02-20 18:51:53,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {23364#true} assume 0 == ~mode1~0 % 256; {23364#true} is VALID [2022-02-20 18:51:54,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {23364#true} assume ~id2~0 >= 0; {23364#true} is VALID [2022-02-20 18:51:54,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {23364#true} assume 0 == ~st2~0; {23364#true} is VALID [2022-02-20 18:51:54,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {23364#true} assume ~send2~0 == ~id2~0; {23364#true} is VALID [2022-02-20 18:51:54,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {23364#true} assume 0 == ~mode2~0 % 256; {23364#true} is VALID [2022-02-20 18:51:54,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {23364#true} assume ~id3~0 >= 0; {23364#true} is VALID [2022-02-20 18:51:54,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {23364#true} assume 0 == ~st3~0; {23364#true} is VALID [2022-02-20 18:51:54,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {23364#true} assume ~send3~0 == ~id3~0; {23364#true} is VALID [2022-02-20 18:51:54,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {23364#true} assume 0 == ~mode3~0 % 256; {23364#true} is VALID [2022-02-20 18:51:54,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {23364#true} assume ~id1~0 != ~id2~0; {23364#true} is VALID [2022-02-20 18:51:54,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {23364#true} assume ~id1~0 != ~id3~0; {23364#true} is VALID [2022-02-20 18:51:54,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {23364#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {23364#true} is VALID [2022-02-20 18:51:54,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {23364#true} 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;main_~main__i2~0#1 := 0; {23364#true} is VALID [2022-02-20 18:51:54,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {23364#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {23364#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {23364#true} is VALID [2022-02-20 18:51:54,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {23364#true} assume ~send1~0 != ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {23364#true} 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; {23364#true} is VALID [2022-02-20 18:51:54,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {23364#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {23364#true} is VALID [2022-02-20 18:51:54,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {23364#true} assume ~send2~0 != ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {23364#true} 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; {23364#true} is VALID [2022-02-20 18:51:54,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {23364#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23364#true} is VALID [2022-02-20 18:51:54,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {23364#true} assume ~send3~0 != ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {23364#true} 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;~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;havoc main_~check__tmp~0#1; {23364#true} is VALID [2022-02-20 18:51:54,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {23364#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {23364#true} is VALID [2022-02-20 18:51:54,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {23364#true} assume !(~r1~0 >= 3); {23364#true} is VALID [2022-02-20 18:51:54,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {23364#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {23364#true} is VALID [2022-02-20 18:51:54,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {23364#true} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {23364#true} is VALID [2022-02-20 18:51:54,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {23364#true} 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; {23364#true} is VALID [2022-02-20 18:51:54,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {23364#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {23364#true} 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {23364#true} assume main_~node1__m1~1#1 != ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {23364#true} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {23364#true} is VALID [2022-02-20 18:51:54,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {23364#true} ~mode1~0 := 0; {23364#true} is VALID [2022-02-20 18:51:54,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {23364#true} ~__tmp_983_0~0 := main_~main____CPAchecker_TMP_0~0#1; {23364#true} is VALID [2022-02-20 18:51:54,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {23364#true} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_983_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {23364#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,004 INFO L290 TraceCheckUtils]: 42: Hoare triple {23364#true} assume main_~node2__m2~2#1 != ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,004 INFO L290 TraceCheckUtils]: 43: Hoare triple {23364#true} assume main_~node2__m2~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {23364#true} is VALID [2022-02-20 18:51:54,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {23364#true} ~mode2~0 := 0; {23364#true} is VALID [2022-02-20 18:51:54,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {23364#true} ~__tmp_649_0~0 := main_~main____CPAchecker_TMP_0~1#1; {23364#true} is VALID [2022-02-20 18:51:54,004 INFO L290 TraceCheckUtils]: 46: Hoare triple {23364#true} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_649_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {23364#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {23364#true} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0; {23364#true} is VALID [2022-02-20 18:51:54,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {23364#true} ~__tmp_516_0~0 := main_~main____CPAchecker_TMP_0~6#1; {23364#true} is VALID [2022-02-20 18:51:54,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {23364#true} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_516_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;havoc main_~check__tmp~15#1; {23364#true} is VALID [2022-02-20 18:51:54,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {23364#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {23364#true} is VALID [2022-02-20 18:51:54,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {23364#true} assume !(~r1~0 >= 3); {23364#true} is VALID [2022-02-20 18:51:54,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {23364#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {23364#true} is VALID [2022-02-20 18:51:54,005 INFO L290 TraceCheckUtils]: 54: Hoare triple {23364#true} assume ~r1~0 < 3;main_~check__tmp~15#1 := 1;~__return_535~0 := main_~check__tmp~15#1;main_~main__c1~0#1 := ~__return_535~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; {23364#true} is VALID [2022-02-20 18:51:54,005 INFO L290 TraceCheckUtils]: 55: Hoare triple {23364#true} assume !(0 == main_~assert__arg~15#1 % 256);main_~main____CPAchecker_TMP_0~9#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_544_0~0 := main_~main____CPAchecker_TMP_0~9#1; {23364#true} is VALID [2022-02-20 18:51:54,005 INFO L290 TraceCheckUtils]: 56: Hoare triple {23364#true} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_544_0~0; {23364#true} is VALID [2022-02-20 18:51:54,005 INFO L290 TraceCheckUtils]: 57: Hoare triple {23364#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~9#1;main_~node1__m1~9#1 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {23364#true} 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~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {23364#true} assume !(main_~node1__m1~9#1 != ~nomsg~0); {23364#true} is VALID [2022-02-20 18:51:54,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {23364#true} ~mode1~0 := 0; {23364#true} is VALID [2022-02-20 18:51:54,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {23364#true} havoc main_~node2__m2~10#1;main_~node2__m2~10#1 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {23364#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~10#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {23364#true} assume !(main_~node2__m2~10#1 != ~nomsg~0); {23364#true} is VALID [2022-02-20 18:51:54,006 INFO L290 TraceCheckUtils]: 64: Hoare triple {23364#true} ~mode2~0 := 0; {23364#true} is VALID [2022-02-20 18:51:54,006 INFO L290 TraceCheckUtils]: 65: Hoare triple {23364#true} havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {23364#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23364#true} is VALID [2022-02-20 18:51:54,007 INFO L290 TraceCheckUtils]: 67: Hoare triple {23364#true} assume !(main_~node3__m3~12#1 != ~nomsg~0); {23364#true} is VALID [2022-02-20 18:51:54,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {23364#true} ~mode3~0 := 0; {23364#true} is VALID [2022-02-20 18:51:54,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {23364#true} ~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;havoc main_~check__tmp~16#1; {23364#true} is VALID [2022-02-20 18:51:54,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {23364#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {23364#true} is VALID [2022-02-20 18:51:54,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {23364#true} assume ~r1~0 >= 3; {23366#(not (<= ~r1~0 2))} is VALID [2022-02-20 18:51:54,008 INFO L290 TraceCheckUtils]: 72: Hoare triple {23366#(not (<= ~r1~0 2))} assume ~r1~0 < 3;main_~check__tmp~16#1 := 1; {23365#false} is VALID [2022-02-20 18:51:54,008 INFO L290 TraceCheckUtils]: 73: Hoare triple {23365#false} ~__return_1310~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1310~0;~__tmp_1164_0~0 := main_~main____CPAchecker_TMP_0~9#1; {23365#false} is VALID [2022-02-20 18:51:54,008 INFO L290 TraceCheckUtils]: 74: Hoare triple {23365#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1164_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {23365#false} is VALID [2022-02-20 18:51:54,008 INFO L290 TraceCheckUtils]: 75: Hoare triple {23365#false} assume 0 == main_~assert__arg~1#1 % 256; {23365#false} is VALID [2022-02-20 18:51:54,008 INFO L290 TraceCheckUtils]: 76: Hoare triple {23365#false} assume !false; {23365#false} is VALID [2022-02-20 18:51:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:54,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:54,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097974249] [2022-02-20 18:51:54,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097974249] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:54,009 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:54,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:54,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423217425] [2022-02-20 18:51:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:54,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:51:54,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:54,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:54,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:54,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:54,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:54,077 INFO L87 Difference]: Start difference. First operand 227 states and 309 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,783 INFO L93 Difference]: Finished difference Result 533 states and 751 transitions. [2022-02-20 18:51:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:56,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:51:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:51:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 18:51:56,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2022-02-20 18:51:56,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:56,868 INFO L225 Difference]: With dead ends: 533 [2022-02-20 18:51:56,868 INFO L226 Difference]: Without dead ends: 367 [2022-02-20 18:51:56,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:56,869 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 50 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:56,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 287 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states.