./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:15,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:15,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:15,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:15,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:15,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:15,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:15,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:15,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:15,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:15,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:15,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:15,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:15,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:15,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:15,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:15,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:15,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:15,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:15,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:15,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:15,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:15,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:15,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:15,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:15,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:15,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:15,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:15,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:15,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:15,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:15,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:15,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:15,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:15,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:15,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:15,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:15,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:15,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:15,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:15,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:15,778 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:15,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:15,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:15,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:15,809 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:15,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:15,810 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:15,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:15,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:15,811 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:15,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:15,812 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:15,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:15,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:15,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:15,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:15,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:15,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:15,813 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:15,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:15,813 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:15,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:15,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:15,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:15,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:15,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:15,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:15,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:15,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:15,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:15,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:15,817 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:15,817 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:15,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:15,817 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 -> 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 [2022-02-20 18:50:16,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:16,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:16,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:16,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:16,074 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:16,075 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:50:16,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07da17fb8/2fd8c2ffa8394a209c576a3c9774f9f8/FLAGbad0c40a2 [2022-02-20 18:50:16,585 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:16,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:50:16,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07da17fb8/2fd8c2ffa8394a209c576a3c9774f9f8/FLAGbad0c40a2 [2022-02-20 18:50:16,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07da17fb8/2fd8c2ffa8394a209c576a3c9774f9f8 [2022-02-20 18:50:16,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:16,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:16,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:16,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:16,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:16,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:16" (1/1) ... [2022-02-20 18:50:16,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516c3fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:16, skipping insertion in model container [2022-02-20 18:50:16,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:16" (1/1) ... [2022-02-20 18:50:16,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:16,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:17,202 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2022-02-20 18:50:17,218 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2022-02-20 18:50:17,226 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2022-02-20 18:50:17,230 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2022-02-20 18:50:17,238 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2022-02-20 18:50:17,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2022-02-20 18:50:17,247 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2022-02-20 18:50:17,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:17,304 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:17,341 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2022-02-20 18:50:17,351 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2022-02-20 18:50:17,355 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2022-02-20 18:50:17,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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2022-02-20 18:50:17,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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2022-02-20 18:50:17,365 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2022-02-20 18:50:17,368 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2022-02-20 18:50:17,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:17,449 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:17,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:17 WrapperNode [2022-02-20 18:50:17,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:17,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:17,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:17,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:17,456 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:17" (1/1) ... [2022-02-20 18:50:17,479 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:17" (1/1) ... [2022-02-20 18:50:17,532 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1020 [2022-02-20 18:50:17,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:17,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:17,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:17,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:17,541 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:17" (1/1) ... [2022-02-20 18:50:17,541 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:17" (1/1) ... [2022-02-20 18:50:17,546 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:17" (1/1) ... [2022-02-20 18:50:17,546 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:17" (1/1) ... [2022-02-20 18:50:17,559 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:17" (1/1) ... [2022-02-20 18:50:17,565 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:17" (1/1) ... [2022-02-20 18:50:17,569 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:17" (1/1) ... [2022-02-20 18:50:17,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:17,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:17,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:17,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:17,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:17" (1/1) ... [2022-02-20 18:50:17,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:17,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:17,615 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:17,632 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:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:17,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:17,791 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:17,792 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:18,697 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:18,705 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:18,706 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:18,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:18 BoogieIcfgContainer [2022-02-20 18:50:18,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:18,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:18,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:18,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:18,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:16" (1/3) ... [2022-02-20 18:50:18,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e541b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:18, skipping insertion in model container [2022-02-20 18:50:18,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:17" (2/3) ... [2022-02-20 18:50:18,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e541b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:18, skipping insertion in model container [2022-02-20 18:50:18,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:18" (3/3) ... [2022-02-20 18:50:18,715 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:50:18,719 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:18,719 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 18:50:18,759 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:18,765 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:18,765 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 18:50:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 206 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call 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:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:50:18,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:18,795 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] [2022-02-20 18:50:18,796 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1485336045, now seen corresponding path program 1 times [2022-02-20 18:50:18,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:18,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123456640] [2022-02-20 18:50:18,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:18,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:19,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {212#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:19,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {212#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:19,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {212#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:19,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {213#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:19,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {213#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {213#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:19,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {213#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {214#(<= (+ ~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; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {214#(<= (+ ~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; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:19,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {211#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~2#1; {211#false} is VALID [2022-02-20 18:50:19,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {211#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~2#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~2#1 % 256 else main_~node2____CPAchecker_TMP_0~2#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {211#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {211#false} is VALID [2022-02-20 18:50:19,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {211#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~4#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~4#1 % 256 else main_~node3____CPAchecker_TMP_0~4#1 % 256 - 256);~mode3~0 := 1;~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; {211#false} is VALID [2022-02-20 18:50:19,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {211#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {211#false} is VALID [2022-02-20 18:50:19,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {211#false} assume !(~r1~0 >= 3); {211#false} is VALID [2022-02-20 18:50:19,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {211#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {211#false} is VALID [2022-02-20 18:50:19,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {211#false} assume ~r1~0 < 3;main_~check__tmp~16#1 := 1;~__return_1484~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1484~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; {211#false} is VALID [2022-02-20 18:50:19,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {211#false} 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_1494_0~0 := main_~main____CPAchecker_TMP_0~9#1; {211#false} is VALID [2022-02-20 18:50:19,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {211#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {211#false} is VALID [2022-02-20 18:50:19,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {211#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {211#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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {211#false} assume main_~node1__m1~1#1 != ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {211#false} assume !(main_~node1__m1~1#1 > ~id1~0); {211#false} is VALID [2022-02-20 18:50:19,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {211#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {211#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {211#false} assume main_~node2__m2~3#1 != ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {211#false} assume !(main_~node2__m2~3#1 > ~id2~0); {211#false} is VALID [2022-02-20 18:50:19,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {211#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {211#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:19,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {211#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {211#false} is VALID [2022-02-20 18:50:19,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {211#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {211#false} is VALID [2022-02-20 18:50:19,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {211#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2127~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2127~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; {211#false} is VALID [2022-02-20 18:50:19,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {211#false} assume 0 == main_~assert__arg~8#1 % 256; {211#false} is VALID [2022-02-20 18:50:19,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-02-20 18:50:19,174 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:19,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:19,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123456640] [2022-02-20 18:50:19,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123456640] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:19,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:19,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:19,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186294748] [2022-02-20 18:50:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:19,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-02-20 18:50:19,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:19,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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:19,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:19,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:19,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:19,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:19,260 INFO L87 Difference]: Start difference. First operand has 207 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 206 states have internal predecessors, (363), 0 states have call successors, (0), 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.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:20,258 INFO L93 Difference]: Finished difference Result 423 states and 706 transitions. [2022-02-20 18:50:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:20,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-02-20 18:50:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2022-02-20 18:50:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2022-02-20 18:50:20,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 706 transitions. [2022-02-20 18:50:20,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 706 edges. 706 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:20,919 INFO L225 Difference]: With dead ends: 423 [2022-02-20 18:50:20,919 INFO L226 Difference]: Without dead ends: 259 [2022-02-20 18:50:20,927 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:20,933 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 1105 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:20,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1105 Valid, 311 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-02-20 18:50:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2022-02-20 18:50:21,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:21,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 235 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 234 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call 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:21,077 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 235 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 234 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call 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:21,077 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 235 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 234 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call 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:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:21,089 INFO L93 Difference]: Finished difference Result 259 states and 329 transitions. [2022-02-20 18:50:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 329 transitions. [2022-02-20 18:50:21,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:21,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:21,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 234 states have internal predecessors, (306), 0 states have call successors, (0), 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 259 states. [2022-02-20 18:50:21,100 INFO L87 Difference]: Start difference. First operand has 235 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 234 states have internal predecessors, (306), 0 states have call successors, (0), 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 259 states. [2022-02-20 18:50:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:21,111 INFO L93 Difference]: Finished difference Result 259 states and 329 transitions. [2022-02-20 18:50:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 329 transitions. [2022-02-20 18:50:21,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:21,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:21,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:21,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 234 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call 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:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 306 transitions. [2022-02-20 18:50:21,124 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 306 transitions. Word has length 47 [2022-02-20 18:50:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:21,125 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 306 transitions. [2022-02-20 18:50:21,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call 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:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 306 transitions. [2022-02-20 18:50:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:21,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:21,127 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:21,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:21,127 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash 200422799, now seen corresponding path program 1 times [2022-02-20 18:50:21,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:21,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789405436] [2022-02-20 18:50:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:21,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {1545#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {1547#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:21,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {1547#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:21,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {1547#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {1547#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:21,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {1547#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1547#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:21,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {1547#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1547#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:21,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1547#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:21,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1547#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:21,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1548#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:21,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {1548#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {1548#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:21,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {1548#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {1549#(<= (+ ~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; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {1549#(<= (+ ~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; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {1549#(<= (+ ~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; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1549#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:21,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {1549#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {1546#false} is VALID [2022-02-20 18:50:21,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {1546#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {1546#false} is VALID [2022-02-20 18:50:21,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {1546#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~2#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;~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~12#1; {1546#false} is VALID [2022-02-20 18:50:21,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {1546#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1546#false} is VALID [2022-02-20 18:50:21,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {1546#false} assume !(~r1~0 >= 3); {1546#false} is VALID [2022-02-20 18:50:21,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {1546#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1546#false} is VALID [2022-02-20 18:50:21,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {1546#false} assume ~r1~0 < 3;main_~check__tmp~12#1 := 1;~__return_1995~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_1995~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; {1546#false} is VALID [2022-02-20 18:50:21,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {1546#false} assume !(0 == main_~assert__arg~11#1 % 256);main_~main____CPAchecker_TMP_0~5#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~5#1; {1546#false} is VALID [2022-02-20 18:50:21,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {1546#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {1546#false} is VALID [2022-02-20 18:50:21,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {1546#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1546#false} is VALID [2022-02-20 18:50:21,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {1546#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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1546#false} is VALID [2022-02-20 18:50:21,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {1546#false} assume main_~node1__m1~1#1 != ~nomsg~0; {1546#false} is VALID [2022-02-20 18:50:21,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {1546#false} assume !(main_~node1__m1~1#1 > ~id1~0); {1546#false} is VALID [2022-02-20 18:50:21,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {1546#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {1546#false} is VALID [2022-02-20 18:50:21,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {1546#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1546#false} is VALID [2022-02-20 18:50:21,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {1546#false} assume main_~node2__m2~3#1 != ~nomsg~0; {1546#false} is VALID [2022-02-20 18:50:21,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {1546#false} assume !(main_~node2__m2~3#1 > ~id2~0); {1546#false} is VALID [2022-02-20 18:50:21,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {1546#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {1546#false} is VALID [2022-02-20 18:50:21,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {1546#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1546#false} is VALID [2022-02-20 18:50:21,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {1546#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {1546#false} is VALID [2022-02-20 18:50:21,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {1546#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {1546#false} is VALID [2022-02-20 18:50:21,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {1546#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2127~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2127~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; {1546#false} is VALID [2022-02-20 18:50:21,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {1546#false} assume 0 == main_~assert__arg~8#1 % 256; {1546#false} is VALID [2022-02-20 18:50:21,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2022-02-20 18:50:21,274 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:21,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:21,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789405436] [2022-02-20 18:50:21,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789405436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:21,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:21,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:21,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751089205] [2022-02-20 18:50:21,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:21,281 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:21,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:21,281 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:21,315 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:21,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:21,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:21,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:21,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:21,316 INFO L87 Difference]: Start difference. First operand 235 states and 306 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:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:21,934 INFO L93 Difference]: Finished difference Result 418 states and 557 transitions. [2022-02-20 18:50:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:21,935 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:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:21,935 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:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 379 transitions. [2022-02-20 18:50:21,944 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:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 379 transitions. [2022-02-20 18:50:21,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 379 transitions. [2022-02-20 18:50:22,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:22,236 INFO L225 Difference]: With dead ends: 418 [2022-02-20 18:50:22,236 INFO L226 Difference]: Without dead ends: 222 [2022-02-20 18:50:22,237 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:22,238 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 554 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:22,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 131 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-02-20 18:50:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-02-20 18:50:22,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:22,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 215 states have (on average 1.344186046511628) internal successors, (289), 221 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call 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:22,416 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 215 states have (on average 1.344186046511628) internal successors, (289), 221 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call 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:22,416 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 215 states have (on average 1.344186046511628) internal successors, (289), 221 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call 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:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:22,423 INFO L93 Difference]: Finished difference Result 222 states and 289 transitions. [2022-02-20 18:50:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2022-02-20 18:50:22,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:22,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:22,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 215 states have (on average 1.344186046511628) internal successors, (289), 221 states have internal predecessors, (289), 0 states have call successors, (0), 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 222 states. [2022-02-20 18:50:22,425 INFO L87 Difference]: Start difference. First operand has 222 states, 215 states have (on average 1.344186046511628) internal successors, (289), 221 states have internal predecessors, (289), 0 states have call successors, (0), 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 222 states. [2022-02-20 18:50:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:22,431 INFO L93 Difference]: Finished difference Result 222 states and 289 transitions. [2022-02-20 18:50:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2022-02-20 18:50:22,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:22,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:22,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:22,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 215 states have (on average 1.344186046511628) internal successors, (289), 221 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call 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:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 289 transitions. [2022-02-20 18:50:22,439 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 289 transitions. Word has length 48 [2022-02-20 18:50:22,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:22,439 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 289 transitions. [2022-02-20 18:50:22,439 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:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2022-02-20 18:50:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:22,441 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:22,441 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] [2022-02-20 18:50:22,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:22,441 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:22,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2021523794, now seen corresponding path program 1 times [2022-02-20 18:50:22,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:22,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889295100] [2022-02-20 18:50:22,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:22,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:22,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {2805#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {2807#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {2807#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:22,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {2807#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {2808#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:22,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {2808#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {2808#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:22,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {2808#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {2809#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {2809#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {2809#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {2809#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {2809#(<= (+ ~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; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {2809#(<= (+ ~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; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {2809#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {2809#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {2809#(<= (+ ~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; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {2809#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {2809#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {2809#(<= (+ ~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; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {2809#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2809#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:22,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {2809#(<= (+ ~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~10#1; {2806#false} is VALID [2022-02-20 18:50:22,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {2806#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2806#false} is VALID [2022-02-20 18:50:22,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {2806#false} assume !(~r1~0 >= 3); {2806#false} is VALID [2022-02-20 18:50:22,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {2806#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2806#false} is VALID [2022-02-20 18:50:22,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {2806#false} assume ~r1~0 < 3;main_~check__tmp~10#1 := 1;~__return_2174~0 := main_~check__tmp~10#1;main_~main__c1~0#1 := ~__return_2174~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; {2806#false} is VALID [2022-02-20 18:50:22,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {2806#false} assume !(0 == main_~assert__arg~9#1 % 256);main_~main____CPAchecker_TMP_0~3#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~3#1; {2806#false} is VALID [2022-02-20 18:50:22,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {2806#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {2806#false} is VALID [2022-02-20 18:50:22,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {2806#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2806#false} is VALID [2022-02-20 18:50:22,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {2806#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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2806#false} is VALID [2022-02-20 18:50:22,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {2806#false} assume main_~node1__m1~1#1 != ~nomsg~0; {2806#false} is VALID [2022-02-20 18:50:22,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {2806#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2806#false} is VALID [2022-02-20 18:50:22,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {2806#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {2806#false} is VALID [2022-02-20 18:50:22,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {2806#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2806#false} is VALID [2022-02-20 18:50:22,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {2806#false} assume main_~node2__m2~3#1 != ~nomsg~0; {2806#false} is VALID [2022-02-20 18:50:22,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {2806#false} assume !(main_~node2__m2~3#1 > ~id2~0); {2806#false} is VALID [2022-02-20 18:50:22,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {2806#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {2806#false} is VALID [2022-02-20 18:50:22,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {2806#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2806#false} is VALID [2022-02-20 18:50:22,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {2806#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {2806#false} is VALID [2022-02-20 18:50:22,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {2806#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {2806#false} is VALID [2022-02-20 18:50:22,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {2806#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2127~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2127~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; {2806#false} is VALID [2022-02-20 18:50:22,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {2806#false} assume 0 == main_~assert__arg~8#1 % 256; {2806#false} is VALID [2022-02-20 18:50:22,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {2806#false} assume !false; {2806#false} is VALID [2022-02-20 18:50:22,562 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:22,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:22,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889295100] [2022-02-20 18:50:22,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889295100] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:22,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:22,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:22,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722643490] [2022-02-20 18:50:22,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:50:22,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:22,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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:22,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:22,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:22,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:22,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:22,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:22,599 INFO L87 Difference]: Start difference. First operand 222 states and 289 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:23,215 INFO L93 Difference]: Finished difference Result 405 states and 538 transitions. [2022-02-20 18:50:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:50:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2022-02-20 18:50:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2022-02-20 18:50:23,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 362 transitions. [2022-02-20 18:50:23,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 362 edges. 362 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:23,510 INFO L225 Difference]: With dead ends: 405 [2022-02-20 18:50:23,510 INFO L226 Difference]: Without dead ends: 217 [2022-02-20 18:50:23,511 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:23,511 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 516 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:23,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 128 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-20 18:50:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-02-20 18:50:23,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:23,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 217 states, 210 states have (on average 1.338095238095238) internal successors, (281), 216 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call 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:23,740 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 217 states, 210 states have (on average 1.338095238095238) internal successors, (281), 216 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call 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:23,740 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 217 states, 210 states have (on average 1.338095238095238) internal successors, (281), 216 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call 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:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:23,746 INFO L93 Difference]: Finished difference Result 217 states and 281 transitions. [2022-02-20 18:50:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 281 transitions. [2022-02-20 18:50:23,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:23,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:23,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 210 states have (on average 1.338095238095238) internal successors, (281), 216 states have internal predecessors, (281), 0 states have call successors, (0), 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 217 states. [2022-02-20 18:50:23,748 INFO L87 Difference]: Start difference. First operand has 217 states, 210 states have (on average 1.338095238095238) internal successors, (281), 216 states have internal predecessors, (281), 0 states have call successors, (0), 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 217 states. [2022-02-20 18:50:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:23,754 INFO L93 Difference]: Finished difference Result 217 states and 281 transitions. [2022-02-20 18:50:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 281 transitions. [2022-02-20 18:50:23,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:23,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:23,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:23,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.338095238095238) internal successors, (281), 216 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call 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:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 281 transitions. [2022-02-20 18:50:23,762 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 281 transitions. Word has length 49 [2022-02-20 18:50:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:23,762 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 281 transitions. [2022-02-20 18:50:23,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call 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:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 281 transitions. [2022-02-20 18:50:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:23,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:23,764 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:23,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:23,764 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1243075504, now seen corresponding path program 1 times [2022-02-20 18:50:23,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:23,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346511033] [2022-02-20 18:50:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:23,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:24,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {4037#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {4039#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:24,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {4039#(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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {4040#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {4041#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {4041#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {4041#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {4041#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {4042#(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; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {4042#(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; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {4042#(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; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {4042#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:24,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {4042#(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; {4043#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:24,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {4043#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4043#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:24,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {4043#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {4043#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:24,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {4043#(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; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {4044#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {4044#(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; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {4044#(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; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {4044#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:24,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {4044#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4045#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} is VALID [2022-02-20 18:50:24,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {4045#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {4038#false} is VALID [2022-02-20 18:50:24,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {4038#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {4038#false} is VALID [2022-02-20 18:50:24,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {4038#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2127~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2127~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; {4038#false} is VALID [2022-02-20 18:50:24,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {4038#false} assume 0 == main_~assert__arg~8#1 % 256; {4038#false} is VALID [2022-02-20 18:50:24,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {4038#false} assume !false; {4038#false} is VALID [2022-02-20 18:50:24,034 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:24,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:24,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346511033] [2022-02-20 18:50:24,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346511033] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:24,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:24,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:24,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482216655] [2022-02-20 18:50:24,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:24,037 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:24,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:24,039 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:24,083 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:24,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:24,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:24,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:24,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:24,084 INFO L87 Difference]: Start difference. First operand 217 states and 281 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:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:26,776 INFO L93 Difference]: Finished difference Result 532 states and 728 transitions. [2022-02-20 18:50:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:26,776 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:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:26,777 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:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 435 transitions. [2022-02-20 18:50:26,781 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:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 435 transitions. [2022-02-20 18:50:26,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 435 transitions. [2022-02-20 18:50:27,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 435 edges. 435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:27,154 INFO L225 Difference]: With dead ends: 532 [2022-02-20 18:50:27,154 INFO L226 Difference]: Without dead ends: 527 [2022-02-20 18:50:27,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:50:27,155 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 1207 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:27,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1207 Valid, 607 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:50:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-02-20 18:50:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 217. [2022-02-20 18:50:27,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:27,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 527 states. Second operand has 217 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 216 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call 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:27,439 INFO L74 IsIncluded]: Start isIncluded. First operand 527 states. Second operand has 217 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 216 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call 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:27,439 INFO L87 Difference]: Start difference. First operand 527 states. Second operand has 217 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 216 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call 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:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:27,455 INFO L93 Difference]: Finished difference Result 527 states and 723 transitions. [2022-02-20 18:50:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 723 transitions. [2022-02-20 18:50:27,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:27,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:27,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 216 states have internal predecessors, (280), 0 states have call successors, (0), 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 527 states. [2022-02-20 18:50:27,458 INFO L87 Difference]: Start difference. First operand has 217 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 216 states have internal predecessors, (280), 0 states have call successors, (0), 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 527 states. [2022-02-20 18:50:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:27,480 INFO L93 Difference]: Finished difference Result 527 states and 723 transitions. [2022-02-20 18:50:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 723 transitions. [2022-02-20 18:50:27,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:27,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:27,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:27,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 216 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call 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:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 280 transitions. [2022-02-20 18:50:27,487 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 280 transitions. Word has length 50 [2022-02-20 18:50:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:27,487 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 280 transitions. [2022-02-20 18:50:27,488 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:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 280 transitions. [2022-02-20 18:50:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:27,488 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:27,489 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:27,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:27,489 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1139694690, now seen corresponding path program 1 times [2022-02-20 18:50:27,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:27,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782214156] [2022-02-20 18:50:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:27,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {6110#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {6112#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:27,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {6112#(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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {6113#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {6113#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {6113#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {6113#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {6114#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {6114#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {6114#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {6114#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {6115#(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; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {6115#(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; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {6115#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:27,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {6115#(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; {6116#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:27,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {6116#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6116#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:27,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {6116#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {6116#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:27,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {6116#(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; {6116#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:27,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {6116#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6116#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:27,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {6116#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {6116#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:27,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {6116#(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; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {6117#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {6117#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {6117#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {6117#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {6117#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {6117#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {6117#(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; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {6117#(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; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {6117#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {6117#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {6117#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {6117#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:27,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {6117#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6118#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} is VALID [2022-02-20 18:50:27,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {6118#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {6111#false} is VALID [2022-02-20 18:50:27,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {6111#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6111#false} is VALID [2022-02-20 18:50:27,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {6111#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6111#false} is VALID [2022-02-20 18:50:27,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {6111#false} assume main_~node3__m3~4#1 != ~nomsg~0; {6111#false} is VALID [2022-02-20 18:50:27,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {6111#false} assume !(main_~node3__m3~4#1 > ~id3~0); {6111#false} is VALID [2022-02-20 18:50:27,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {6111#false} assume main_~node3__m3~4#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~7#1; {6111#false} is VALID [2022-02-20 18:50:27,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {6111#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1932~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1932~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {6111#false} is VALID [2022-02-20 18:50:27,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {6111#false} assume 0 == main_~assert__arg~7#1 % 256; {6111#false} is VALID [2022-02-20 18:50:27,709 INFO L290 TraceCheckUtils]: 49: Hoare triple {6111#false} assume !false; {6111#false} is VALID [2022-02-20 18:50:27,709 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:27,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:27,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782214156] [2022-02-20 18:50:27,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782214156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:27,710 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:27,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:27,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083807403] [2022-02-20 18:50:27,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:27,711 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:27,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:27,711 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:27,745 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:27,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:27,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:27,746 INFO L87 Difference]: Start difference. First operand 217 states and 280 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:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:30,375 INFO L93 Difference]: Finished difference Result 536 states and 731 transitions. [2022-02-20 18:50:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:30,376 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:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:30,376 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:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 518 transitions. [2022-02-20 18:50:30,381 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:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 518 transitions. [2022-02-20 18:50:30,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 518 transitions. [2022-02-20 18:50:30,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:30,829 INFO L225 Difference]: With dead ends: 536 [2022-02-20 18:50:30,829 INFO L226 Difference]: Without dead ends: 435 [2022-02-20 18:50:30,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:50:30,832 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 1030 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:30,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1030 Valid, 811 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:50:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-02-20 18:50:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 217. [2022-02-20 18:50:31,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:31,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand has 217 states, 210 states have (on average 1.3285714285714285) internal successors, (279), 216 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call 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:31,137 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand has 217 states, 210 states have (on average 1.3285714285714285) internal successors, (279), 216 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call 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:31,137 INFO L87 Difference]: Start difference. First operand 435 states. Second operand has 217 states, 210 states have (on average 1.3285714285714285) internal successors, (279), 216 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call 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:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:31,150 INFO L93 Difference]: Finished difference Result 435 states and 585 transitions. [2022-02-20 18:50:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 585 transitions. [2022-02-20 18:50:31,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:31,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:31,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 210 states have (on average 1.3285714285714285) internal successors, (279), 216 states have internal predecessors, (279), 0 states have call successors, (0), 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 435 states. [2022-02-20 18:50:31,152 INFO L87 Difference]: Start difference. First operand has 217 states, 210 states have (on average 1.3285714285714285) internal successors, (279), 216 states have internal predecessors, (279), 0 states have call successors, (0), 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 435 states. [2022-02-20 18:50:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:31,166 INFO L93 Difference]: Finished difference Result 435 states and 585 transitions. [2022-02-20 18:50:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 585 transitions. [2022-02-20 18:50:31,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:31,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:31,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:31,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.3285714285714285) internal successors, (279), 216 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call 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:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 279 transitions. [2022-02-20 18:50:31,173 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 279 transitions. Word has length 50 [2022-02-20 18:50:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:31,173 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 279 transitions. [2022-02-20 18:50:31,173 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:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 279 transitions. [2022-02-20 18:50:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:31,174 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:31,174 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:31,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:31,175 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:31,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 134088220, now seen corresponding path program 1 times [2022-02-20 18:50:31,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:31,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054542784] [2022-02-20 18:50:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:31,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:31,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {7998#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {8000#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:31,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {8000#(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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {8001#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {8002#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {8002#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {8002#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {8002#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~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; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~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; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~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; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~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; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:31,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {8003#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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; {8004#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:31,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {8004#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8004#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:31,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {8004#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 3); {8004#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:31,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {8004#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {8004#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:31,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {8004#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {8004#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:31,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {8004#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {8004#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:31,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {8004#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {8004#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:31,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {8004#(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; {8004#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:31,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {8004#(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; {8005#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:50:31,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {8005#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {7999#false} is VALID [2022-02-20 18:50:31,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {7999#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7999#false} is VALID [2022-02-20 18:50:31,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {7999#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7999#false} is VALID [2022-02-20 18:50:31,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {7999#false} assume main_~node2__m2~1#1 != ~nomsg~0; {7999#false} is VALID [2022-02-20 18:50:31,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {7999#false} assume !(main_~node2__m2~1#1 > ~id2~0); {7999#false} is VALID [2022-02-20 18:50:31,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {7999#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {7999#false} is VALID [2022-02-20 18:50:31,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {7999#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7999#false} is VALID [2022-02-20 18:50:31,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {7999#false} assume main_~node3__m3~3#1 != ~nomsg~0; {7999#false} is VALID [2022-02-20 18:50:31,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {7999#false} assume !(main_~node3__m3~3#1 > ~id3~0); {7999#false} is VALID [2022-02-20 18:50:31,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {7999#false} assume main_~node3__m3~3#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~5#1; {7999#false} is VALID [2022-02-20 18:50:31,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {7999#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2210~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2210~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; {7999#false} is VALID [2022-02-20 18:50:31,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {7999#false} assume 0 == main_~assert__arg~5#1 % 256; {7999#false} is VALID [2022-02-20 18:50:31,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {7999#false} assume !false; {7999#false} is VALID [2022-02-20 18:50:31,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:50:31,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:31,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054542784] [2022-02-20 18:50:31,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054542784] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:31,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:31,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:50:31,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078205627] [2022-02-20 18:50:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:31,342 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:31,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:31,342 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:31,377 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:31,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:50:31,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:50:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:31,378 INFO L87 Difference]: Start difference. First operand 217 states and 279 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:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:32,820 INFO L93 Difference]: Finished difference Result 461 states and 610 transitions. [2022-02-20 18:50:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:50:32,820 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:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:32,821 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:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 392 transitions. [2022-02-20 18:50:32,823 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:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 392 transitions. [2022-02-20 18:50:32,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 392 transitions. [2022-02-20 18:50:33,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:33,170 INFO L225 Difference]: With dead ends: 461 [2022-02-20 18:50:33,172 INFO L226 Difference]: Without dead ends: 337 [2022-02-20 18:50:33,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:50:33,176 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 857 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:33,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [857 Valid, 369 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-02-20 18:50:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 217. [2022-02-20 18:50:33,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:33,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 217 states, 210 states have (on average 1.3238095238095238) internal successors, (278), 216 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call 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:33,505 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 217 states, 210 states have (on average 1.3238095238095238) internal successors, (278), 216 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call 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:33,506 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 217 states, 210 states have (on average 1.3238095238095238) internal successors, (278), 216 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call 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:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:33,513 INFO L93 Difference]: Finished difference Result 337 states and 437 transitions. [2022-02-20 18:50:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 437 transitions. [2022-02-20 18:50:33,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:33,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:33,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 210 states have (on average 1.3238095238095238) internal successors, (278), 216 states have internal predecessors, (278), 0 states have call successors, (0), 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:33,515 INFO L87 Difference]: Start difference. First operand has 217 states, 210 states have (on average 1.3238095238095238) internal successors, (278), 216 states have internal predecessors, (278), 0 states have call successors, (0), 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:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:33,523 INFO L93 Difference]: Finished difference Result 337 states and 437 transitions. [2022-02-20 18:50:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 437 transitions. [2022-02-20 18:50:33,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:33,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:33,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:33,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.3238095238095238) internal successors, (278), 216 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call 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:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 278 transitions. [2022-02-20 18:50:33,529 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 278 transitions. Word has length 50 [2022-02-20 18:50:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:33,529 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 278 transitions. [2022-02-20 18:50:33,529 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:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 278 transitions. [2022-02-20 18:50:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:33,530 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:33,531 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:50:33,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:33,531 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:33,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1263855603, now seen corresponding path program 1 times [2022-02-20 18:50:33,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:33,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448644296] [2022-02-20 18:50:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:33,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {9567#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {9567#true} is VALID [2022-02-20 18:50:33,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {9567#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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {9569#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {9570#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {9570#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {9570#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {9570#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {9571#(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:50:33,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {9571#(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; {9571#(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:50:33,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {9571#(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; {9572#(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:50:33,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {9572#(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; {9572#(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:50:33,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {9572#(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; {9572#(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:50:33,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {9572#(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; {9572#(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:50:33,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {9572#(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; {9572#(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:50:33,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {9572#(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; {9572#(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:50:33,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {9572#(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_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {9573#(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:50:33,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {9573#(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; {9573#(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:50:33,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {9573#(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; {9573#(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:50:33,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {9573#(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; {9573#(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:50:33,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {9573#(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; {9573#(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:50:33,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {9573#(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; {9573#(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:50:33,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {9573#(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; {9573#(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:50:33,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {9573#(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; {9573#(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:50:33,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {9573#(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; {9574#(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:50:33,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {9574#(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; {9574#(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:50:33,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {9574#(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; {9574#(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:50:33,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {9574#(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; {9575#(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:50:33,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {9575#(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; {9575#(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:50:33,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {9575#(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); {9575#(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:50:33,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {9575#(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; {9575#(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:50:33,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {9575#(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_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {9575#(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:50:33,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {9575#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {9575#(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:50:33,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {9575#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {9575#(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:50:33,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {9575#(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; {9575#(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:50:33,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {9575#(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; {9575#(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:50:33,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {9575#(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; {9575#(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:50:33,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {9575#(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); {9575#(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:50:33,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {9575#(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~3#1;main_~node2__m2~3#1 := ~nomsg~0; {9575#(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:50:33,965 INFO L290 TraceCheckUtils]: 40: Hoare triple {9575#(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~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9575#(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:50:33,965 INFO L290 TraceCheckUtils]: 41: Hoare triple {9575#(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~3#1 != ~nomsg~0; {9575#(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:50:33,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {9575#(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~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {9576#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:33,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {9576#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {9576#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:33,967 INFO L290 TraceCheckUtils]: 44: Hoare triple {9576#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {9576#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:33,967 INFO L290 TraceCheckUtils]: 45: Hoare triple {9576#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9577#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} is VALID [2022-02-20 18:50:33,973 INFO L290 TraceCheckUtils]: 46: Hoare triple {9577#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} assume main_~node3__m3~4#1 != ~nomsg~0; {9577#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} is VALID [2022-02-20 18:50:33,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {9577#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} assume !(main_~node3__m3~4#1 > ~id3~0); {9578#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:50:33,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {9578#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#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~7#1; {9568#false} is VALID [2022-02-20 18:50:33,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {9568#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1932~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1932~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {9568#false} is VALID [2022-02-20 18:50:33,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {9568#false} assume 0 == main_~assert__arg~7#1 % 256; {9568#false} is VALID [2022-02-20 18:50:33,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {9568#false} assume !false; {9568#false} is VALID [2022-02-20 18:50:33,976 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:33,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:33,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448644296] [2022-02-20 18:50:33,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448644296] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:33,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:33,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:33,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324706438] [2022-02-20 18:50:33,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:33,979 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:50:33,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:33,979 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:50:34,024 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:50:34,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:34,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:34,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:34,025 INFO L87 Difference]: Start difference. First operand 217 states and 278 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:50:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:36,799 INFO L93 Difference]: Finished difference Result 447 states and 597 transitions. [2022-02-20 18:50:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:50:36,799 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:50:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:36,799 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:50:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 370 transitions. [2022-02-20 18:50:36,802 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:50:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 370 transitions. [2022-02-20 18:50:36,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 370 transitions. [2022-02-20 18:50:37,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:37,105 INFO L225 Difference]: With dead ends: 447 [2022-02-20 18:50:37,105 INFO L226 Difference]: Without dead ends: 359 [2022-02-20 18:50:37,105 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:50:37,106 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 1053 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:37,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 763 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-02-20 18:50:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 213. [2022-02-20 18:50:37,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:37,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 213 states, 207 states have (on average 1.318840579710145) internal successors, (273), 212 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call 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:37,660 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 213 states, 207 states have (on average 1.318840579710145) internal successors, (273), 212 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call 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:37,660 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 213 states, 207 states have (on average 1.318840579710145) internal successors, (273), 212 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call 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:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:37,667 INFO L93 Difference]: Finished difference Result 359 states and 465 transitions. [2022-02-20 18:50:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 465 transitions. [2022-02-20 18:50:37,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:37,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:37,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 207 states have (on average 1.318840579710145) internal successors, (273), 212 states have internal predecessors, (273), 0 states have call successors, (0), 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 359 states. [2022-02-20 18:50:37,669 INFO L87 Difference]: Start difference. First operand has 213 states, 207 states have (on average 1.318840579710145) internal successors, (273), 212 states have internal predecessors, (273), 0 states have call successors, (0), 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 359 states. [2022-02-20 18:50:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:37,679 INFO L93 Difference]: Finished difference Result 359 states and 465 transitions. [2022-02-20 18:50:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 465 transitions. [2022-02-20 18:50:37,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:37,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:37,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:37,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.318840579710145) internal successors, (273), 212 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call 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:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 273 transitions. [2022-02-20 18:50:37,684 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 273 transitions. Word has length 52 [2022-02-20 18:50:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:37,684 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 273 transitions. [2022-02-20 18:50:37,685 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:50:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 273 transitions. [2022-02-20 18:50:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:37,685 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:37,686 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:50:37,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:37,686 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1250594545, now seen corresponding path program 1 times [2022-02-20 18:50:37,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:37,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093451765] [2022-02-20 18:50:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:38,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {11176#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {11176#true} is VALID [2022-02-20 18:50:38,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {11176#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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {11178#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:38,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {11178#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {11178#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:38,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {11178#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {11179#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:38,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {11179#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {11179#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:38,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {11179#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {11180#(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:50:38,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {11180#(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; {11180#(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:50:38,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {11180#(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; {11181#(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:50:38,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {11181#(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; {11181#(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:50:38,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {11181#(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; {11181#(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:50:38,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {11181#(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; {11181#(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:50:38,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {11181#(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; {11181#(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:50:38,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {11181#(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; {11181#(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:50:38,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {11181#(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; {11181#(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:50:38,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {11181#(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; {11181#(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:50:38,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {11181#(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; {11182#(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:50:38,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {11182#(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; {11182#(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:50:38,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {11182#(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_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {11182#(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:50:38,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {11182#(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; {11182#(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:50:38,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {11182#(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; {11182#(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:50:38,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {11182#(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; {11182#(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:50:38,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {11182#(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; {11182#(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:50:38,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {11182#(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; {11183#(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:50:38,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {11183#(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; {11183#(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:50:38,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {11183#(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; {11183#(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:50:38,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {11183#(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; {11183#(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:50:38,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {11183#(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; {11183#(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:50:38,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {11183#(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; {11183#(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:50:38,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {11183#(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; {11184#(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:50:38,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {11184#(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; {11184#(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:50:38,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {11184#(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); {11184#(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:50:38,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {11184#(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; {11184#(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:50:38,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {11184#(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_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {11184#(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:50:38,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {11184#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {11184#(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:50:38,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {11184#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {11184#(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:50:38,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {11184#(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; {11184#(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:50:38,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {11184#(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; {11184#(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:50:38,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {11184#(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; {11184#(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:50:38,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {11184#(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); {11184#(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:50:38,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {11184#(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;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {11185#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:38,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {11185#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11186#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} is VALID [2022-02-20 18:50:38,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {11186#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {11186#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} is VALID [2022-02-20 18:50:38,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {11186#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {11187#(<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0)} is VALID [2022-02-20 18:50:38,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {11187#(<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0)} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {11177#false} is VALID [2022-02-20 18:50:38,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {11177#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11177#false} is VALID [2022-02-20 18:50:38,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {11177#false} assume main_~node3__m3~5#1 != ~nomsg~0; {11177#false} is VALID [2022-02-20 18:50:38,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {11177#false} assume main_~node3__m3~5#1 > ~id3~0;~send3~0 := main_~node3__m3~5#1; {11177#false} is VALID [2022-02-20 18:50:38,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {11177#false} ~mode3~0 := 0; {11177#false} is VALID [2022-02-20 18:50:38,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {11177#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {11177#false} is VALID [2022-02-20 18:50:38,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {11177#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2127~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2127~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; {11177#false} is VALID [2022-02-20 18:50:38,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {11177#false} assume 0 == main_~assert__arg~8#1 % 256; {11177#false} is VALID [2022-02-20 18:50:38,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {11177#false} assume !false; {11177#false} is VALID [2022-02-20 18:50:38,157 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:38,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:38,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093451765] [2022-02-20 18:50:38,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093451765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:38,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:38,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:38,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830272171] [2022-02-20 18:50:38,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:38,160 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:50:38,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:38,162 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:50:38,205 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:50:38,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:38,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:38,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:38,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:38,206 INFO L87 Difference]: Start difference. First operand 213 states and 273 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:50:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:40,230 INFO L93 Difference]: Finished difference Result 311 states and 414 transitions. [2022-02-20 18:50:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:50:40,230 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:50:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:40,231 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:50:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 265 transitions. [2022-02-20 18:50:40,232 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:50:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 265 transitions. [2022-02-20 18:50:40,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 265 transitions. [2022-02-20 18:50:40,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:40,441 INFO L225 Difference]: With dead ends: 311 [2022-02-20 18:50:40,441 INFO L226 Difference]: Without dead ends: 216 [2022-02-20 18:50:40,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:50:40,442 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 470 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:40,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 990 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-20 18:50:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 202. [2022-02-20 18:50:41,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:41,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 202 states, 197 states have (on average 1.3197969543147208) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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:41,097 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 202 states, 197 states have (on average 1.3197969543147208) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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:41,097 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 202 states, 197 states have (on average 1.3197969543147208) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:41,100 INFO L93 Difference]: Finished difference Result 216 states and 275 transitions. [2022-02-20 18:50:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2022-02-20 18:50:41,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:41,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:41,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 197 states have (on average 1.3197969543147208) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 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 216 states. [2022-02-20 18:50:41,102 INFO L87 Difference]: Start difference. First operand has 202 states, 197 states have (on average 1.3197969543147208) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 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 216 states. [2022-02-20 18:50:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:41,105 INFO L93 Difference]: Finished difference Result 216 states and 275 transitions. [2022-02-20 18:50:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2022-02-20 18:50:41,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:41,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:41,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:41,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.3197969543147208) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 260 transitions. [2022-02-20 18:50:41,110 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 260 transitions. Word has length 52 [2022-02-20 18:50:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:41,111 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 260 transitions. [2022-02-20 18:50:41,111 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:50:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 260 transitions. [2022-02-20 18:50:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:41,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:41,112 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:50:41,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:50:41,112 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1706910886, now seen corresponding path program 1 times [2022-02-20 18:50:41,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:41,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278264642] [2022-02-20 18:50:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:41,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {12300#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {12300#true} is VALID [2022-02-20 18:50:41,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {12300#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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:41,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:41,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:41,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:41,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:41,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:41,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {12302#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {12303#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:41,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {12303#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {12303#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:41,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {12303#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {12304#(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:50:41,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {12304#(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; {12304#(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:50:41,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {12304#(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; {12305#(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:50:41,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {12305#(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; {12305#(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:50:41,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {12305#(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; {12305#(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:50:41,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {12305#(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; {12305#(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:50:41,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {12305#(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; {12305#(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:50:41,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {12305#(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; {12305#(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:50:41,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {12305#(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_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {12306#(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:50:41,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {12306#(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; {12306#(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:50:41,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {12306#(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; {12306#(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:50:41,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {12306#(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; {12306#(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:50:41,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {12306#(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; {12306#(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:50:41,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {12306#(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; {12306#(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:50:41,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {12306#(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; {12306#(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:50:41,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {12306#(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; {12306#(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:50:41,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {12306#(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; {12307#(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:50:41,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {12307#(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; {12307#(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:50:41,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {12307#(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; {12307#(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:50:41,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {12307#(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; {12308#(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:50:41,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {12308#(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; {12308#(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:50:41,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {12308#(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); {12308#(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:50:41,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {12308#(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; {12308#(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:50:41,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {12308#(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_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {12308#(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:50:41,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {12308#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {12308#(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:50:41,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {12308#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {12308#(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:50:41,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {12308#(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; {12308#(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:50:41,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {12308#(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; {12308#(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:50:41,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {12308#(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; {12308#(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:50:41,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {12308#(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;~send1~0 := main_~node1__m1~1#1; {12308#(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:50:41,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {12308#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} ~mode1~0 := 0; {12308#(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:50:41,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {12308#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12308#(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:50:41,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {12308#(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; {12308#(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:50:41,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {12308#(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; {12308#(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:50:41,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {12308#(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); {12308#(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:50:41,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {12308#(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;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {12309#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:41,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {12309#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12310#(or (<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:50:41,512 INFO L290 TraceCheckUtils]: 46: Hoare triple {12310#(or (<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~3#1|))} assume main_~node3__m3~3#1 != ~nomsg~0; {12310#(or (<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:50:41,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {12310#(or (<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~3#1|))} assume !(main_~node3__m3~3#1 > ~id3~0); {12311#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} is VALID [2022-02-20 18:50:41,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {12311#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} assume main_~node3__m3~3#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~5#1; {12301#false} is VALID [2022-02-20 18:50:41,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {12301#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2210~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2210~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; {12301#false} is VALID [2022-02-20 18:50:41,512 INFO L290 TraceCheckUtils]: 50: Hoare triple {12301#false} assume 0 == main_~assert__arg~5#1 % 256; {12301#false} is VALID [2022-02-20 18:50:41,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {12301#false} assume !false; {12301#false} is VALID [2022-02-20 18:50:41,513 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:41,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:41,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278264642] [2022-02-20 18:50:41,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278264642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:41,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:41,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:41,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656069378] [2022-02-20 18:50:41,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:41,514 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:50:41,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:41,514 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:50:41,554 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:50:41,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:41,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:41,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:41,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:41,555 INFO L87 Difference]: Start difference. First operand 202 states and 260 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:50:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,279 INFO L93 Difference]: Finished difference Result 340 states and 445 transitions. [2022-02-20 18:50:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:50:44,280 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:50:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:44,280 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:50:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 280 transitions. [2022-02-20 18:50:44,282 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:50:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 280 transitions. [2022-02-20 18:50:44,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 280 transitions. [2022-02-20 18:50:44,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:44,518 INFO L225 Difference]: With dead ends: 340 [2022-02-20 18:50:44,518 INFO L226 Difference]: Without dead ends: 336 [2022-02-20 18:50:44,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:50:44,519 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 970 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:44,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [970 Valid, 706 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-02-20 18:50:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 198. [2022-02-20 18:50:45,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:45,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 198 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 197 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call 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:45,191 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 198 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 197 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call 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:45,192 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 198 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 197 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call 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:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,198 INFO L93 Difference]: Finished difference Result 336 states and 441 transitions. [2022-02-20 18:50:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 441 transitions. [2022-02-20 18:50:45,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 197 states have internal predecessors, (256), 0 states have call successors, (0), 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 336 states. [2022-02-20 18:50:45,199 INFO L87 Difference]: Start difference. First operand has 198 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 197 states have internal predecessors, (256), 0 states have call successors, (0), 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 336 states. [2022-02-20 18:50:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,206 INFO L93 Difference]: Finished difference Result 336 states and 441 transitions. [2022-02-20 18:50:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 441 transitions. [2022-02-20 18:50:45,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:45,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 197 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call 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:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 256 transitions. [2022-02-20 18:50:45,211 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 256 transitions. Word has length 52 [2022-02-20 18:50:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:45,211 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 256 transitions. [2022-02-20 18:50:45,211 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:50:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 256 transitions. [2022-02-20 18:50:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:50:45,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:45,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:45,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:50:45,213 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 190692674, now seen corresponding path program 1 times [2022-02-20 18:50:45,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:45,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704694829] [2022-02-20 18:50:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:45,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {13697#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {13699#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:45,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {13699#(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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {13700#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {13701#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {13701#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {13701#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {13701#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode2~0 % 256; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id3~0 >= 0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~st3~0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send3~0 == ~id3~0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode3~0 % 256; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id2~0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id3~0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send1~0 != ~nomsg~0; {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:50:45,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {13702#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13703#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:50:45,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {13703#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13703#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:50:45,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {13703#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume ~send2~0 != ~nomsg~0; {13703#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:50:45,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {13703#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13704#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:50:45,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {13704#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13704#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:50:45,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {13704#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~send3~0 != ~nomsg~0; {13704#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:50:45,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {13704#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(~r1~0 >= 3); {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (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; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (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; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {13705#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13706#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {13706#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node2__m2~3#1 != ~nomsg~0; {13706#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:50:45,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {13706#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {13707#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {13707#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {13707#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {13707#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {13707#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {13707#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13708#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:50:45,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {13698#false} is VALID [2022-02-20 18:50:45,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {13698#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {13698#false} is VALID [2022-02-20 18:50:45,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {13698#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13698#false} is VALID [2022-02-20 18:50:45,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {13698#false} assume !(~r1~0 >= 3); {13698#false} is VALID [2022-02-20 18:50:45,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {13698#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1777~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1777~0;havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~6#1;main_~assert__arg~6#1 := main_~__tmp_7~0#1; {13698#false} is VALID [2022-02-20 18:50:45,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {13698#false} assume 0 == main_~assert__arg~6#1 % 256; {13698#false} is VALID [2022-02-20 18:50:45,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {13698#false} assume !false; {13698#false} is VALID [2022-02-20 18:50:45,467 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:45,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:45,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704694829] [2022-02-20 18:50:45,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704694829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:45,467 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:45,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:50:45,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419255759] [2022-02-20 18:50:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:50:45,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:45,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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:45,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:45,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:45,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:45,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:45,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:45,506 INFO L87 Difference]: Start difference. First operand 198 states and 256 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,326 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-02-20 18:50:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:50:50,326 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:50:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 457 transitions. [2022-02-20 18:50:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 457 transitions. [2022-02-20 18:50:50,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 457 transitions. [2022-02-20 18:50:50,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:50,751 INFO L225 Difference]: With dead ends: 582 [2022-02-20 18:50:50,751 INFO L226 Difference]: Without dead ends: 575 [2022-02-20 18:50:50,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2022-02-20 18:50:50,752 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 2160 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:50,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2160 Valid, 492 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:50:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-02-20 18:50:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 202. [2022-02-20 18:50:51,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:51,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 575 states. Second operand has 202 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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,472 INFO L74 IsIncluded]: Start isIncluded. First operand 575 states. Second operand has 202 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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,472 INFO L87 Difference]: Start difference. First operand 575 states. Second operand has 202 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,488 INFO L93 Difference]: Finished difference Result 575 states and 787 transitions. [2022-02-20 18:50:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 787 transitions. [2022-02-20 18:50:51,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 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 575 states. [2022-02-20 18:50:51,490 INFO L87 Difference]: Start difference. First operand has 202 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 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 575 states. [2022-02-20 18:50:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,506 INFO L93 Difference]: Finished difference Result 575 states and 787 transitions. [2022-02-20 18:50:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 787 transitions. [2022-02-20 18:50:51,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:51,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 201 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 260 transitions. [2022-02-20 18:50:51,511 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 260 transitions. Word has length 53 [2022-02-20 18:50:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:51,512 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 260 transitions. [2022-02-20 18:50:51,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,512 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 260 transitions. [2022-02-20 18:50:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:50:51,513 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:51,513 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] [2022-02-20 18:50:51,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:50:51,513 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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:51,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -659119293, now seen corresponding path program 1 times [2022-02-20 18:50:51,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:51,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744291945] [2022-02-20 18:50:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:51,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {15941#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {15943#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:51,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {15943#(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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {15944#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {15945#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {15945#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {15945#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {15945#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {15946#(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; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {15946#(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; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {15946#(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; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {15946#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {15946#(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; {15947#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:51,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {15947#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15947#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:51,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {15947#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {15947#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:51,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {15947#(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; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {15948#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {15948#(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; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {15948#(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; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {15948#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {15948#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15949#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:50:51,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {15949#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} assume !(main_~node3__m3~3#1 != ~nomsg~0);~mode3~0 := 0; {15942#false} is VALID [2022-02-20 18:50:51,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {15942#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~4#1; {15942#false} is VALID [2022-02-20 18:50:51,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {15942#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15942#false} is VALID [2022-02-20 18:50:51,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {15942#false} assume !(~r1~0 >= 3); {15942#false} is VALID [2022-02-20 18:50:51,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {15942#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~4#1 := 0;~__return_2046~0 := main_~check__tmp~4#1;main_~main__c1~0#1 := ~__return_2046~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; {15942#false} is VALID [2022-02-20 18:50:51,644 INFO L290 TraceCheckUtils]: 51: Hoare triple {15942#false} assume 0 == main_~assert__arg~4#1 % 256; {15942#false} is VALID [2022-02-20 18:50:51,644 INFO L290 TraceCheckUtils]: 52: Hoare triple {15942#false} assume !false; {15942#false} is VALID [2022-02-20 18:50:51,645 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,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:51,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744291945] [2022-02-20 18:50:51,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744291945] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:51,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:51,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:51,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140973400] [2022-02-20 18:50:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:51,646 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:50:51,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:51,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:51,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:51,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:51,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:51,690 INFO L87 Difference]: Start difference. First operand 202 states and 260 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,144 INFO L93 Difference]: Finished difference Result 339 states and 443 transitions. [2022-02-20 18:50:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:50:54,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:50:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2022-02-20 18:50:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2022-02-20 18:50:54,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 276 transitions. [2022-02-20 18:50:54,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:54,361 INFO L225 Difference]: With dead ends: 339 [2022-02-20 18:50:54,361 INFO L226 Difference]: Without dead ends: 332 [2022-02-20 18:50:54,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:50:54,362 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 927 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:54,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 424 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-02-20 18:50:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 202. [2022-02-20 18:50:55,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:55,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 332 states. Second operand has 202 states, 198 states have (on average 1.3080808080808082) internal successors, (259), 201 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call 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:55,090 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand has 202 states, 198 states have (on average 1.3080808080808082) internal successors, (259), 201 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call 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:55,090 INFO L87 Difference]: Start difference. First operand 332 states. Second operand has 202 states, 198 states have (on average 1.3080808080808082) internal successors, (259), 201 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call 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:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,097 INFO L93 Difference]: Finished difference Result 332 states and 436 transitions. [2022-02-20 18:50:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 436 transitions. [2022-02-20 18:50:55,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:55,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:55,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 198 states have (on average 1.3080808080808082) internal successors, (259), 201 states have internal predecessors, (259), 0 states have call successors, (0), 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 332 states. [2022-02-20 18:50:55,098 INFO L87 Difference]: Start difference. First operand has 202 states, 198 states have (on average 1.3080808080808082) internal successors, (259), 201 states have internal predecessors, (259), 0 states have call successors, (0), 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 332 states. [2022-02-20 18:50:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,105 INFO L93 Difference]: Finished difference Result 332 states and 436 transitions. [2022-02-20 18:50:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 436 transitions. [2022-02-20 18:50:55,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:55,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:55,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:55,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.3080808080808082) internal successors, (259), 201 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call 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:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 259 transitions. [2022-02-20 18:50:55,110 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 259 transitions. Word has length 53 [2022-02-20 18:50:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:55,111 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 259 transitions. [2022-02-20 18:50:55,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2022-02-20 18:50:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:50:55,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:55,112 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] [2022-02-20 18:50:55,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:50:55,112 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:55,113 INFO L85 PathProgramCache]: Analyzing trace with hash 339917441, now seen corresponding path program 1 times [2022-02-20 18:50:55,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:55,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847894660] [2022-02-20 18:50:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:55,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:55,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {17336#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {17338#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {17338#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {17339#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {17339#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {17339#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {17339#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {17340#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {17340#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {17340#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {17340#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {17341#(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_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {17341#(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; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {17341#(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; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {17341#(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; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {17341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {17341#(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; {17342#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:55,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {17342#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {17342#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:55,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {17342#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {17342#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:55,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {17342#(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; {17342#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:55,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {17342#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17342#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:55,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {17342#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {17342#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:55,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {17342#(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; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {17343#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {17343#(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; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {17343#(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; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {17343#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:55,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {17343#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17344#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:55,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {17344#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {17337#false} is VALID [2022-02-20 18:50:55,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {17337#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {17337#false} is VALID [2022-02-20 18:50:55,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {17337#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17337#false} is VALID [2022-02-20 18:50:55,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {17337#false} assume main_~node3__m3~1#1 != ~nomsg~0; {17337#false} is VALID [2022-02-20 18:50:55,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {17337#false} assume !(main_~node3__m3~1#1 > ~id3~0); {17337#false} is VALID [2022-02-20 18:50:55,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {17337#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~3#1; {17337#false} is VALID [2022-02-20 18:50:55,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {17337#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17337#false} is VALID [2022-02-20 18:50:55,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {17337#false} assume !(~r1~0 >= 3); {17337#false} is VALID [2022-02-20 18:50:55,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {17337#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1863~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1863~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; {17337#false} is VALID [2022-02-20 18:50:55,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {17337#false} assume 0 == main_~assert__arg~3#1 % 256; {17337#false} is VALID [2022-02-20 18:50:55,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {17337#false} assume !false; {17337#false} is VALID [2022-02-20 18:50:55,238 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:55,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:55,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847894660] [2022-02-20 18:50:55,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847894660] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:55,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:55,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:55,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022370214] [2022-02-20 18:50:55,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:55,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:50:55,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:55,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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:55,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:55,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:55,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:55,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:55,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:55,282 INFO L87 Difference]: Start difference. First operand 202 states and 259 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:56,842 INFO L93 Difference]: Finished difference Result 319 states and 423 transitions. [2022-02-20 18:50:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:50:56,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:50:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 254 transitions. [2022-02-20 18:50:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 254 transitions. [2022-02-20 18:50:56,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 254 transitions. [2022-02-20 18:50:57,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:57,022 INFO L225 Difference]: With dead ends: 319 [2022-02-20 18:50:57,022 INFO L226 Difference]: Without dead ends: 205 [2022-02-20 18:50:57,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:50:57,023 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 491 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:57,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 358 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-02-20 18:50:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2022-02-20 18:50:57,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:57,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 202 states, 198 states have (on average 1.297979797979798) internal successors, (257), 201 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call 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:57,759 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 202 states, 198 states have (on average 1.297979797979798) internal successors, (257), 201 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call 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:57,759 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 202 states, 198 states have (on average 1.297979797979798) internal successors, (257), 201 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call 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:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,762 INFO L93 Difference]: Finished difference Result 205 states and 260 transitions. [2022-02-20 18:50:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2022-02-20 18:50:57,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 198 states have (on average 1.297979797979798) internal successors, (257), 201 states have internal predecessors, (257), 0 states have call successors, (0), 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 205 states. [2022-02-20 18:50:57,764 INFO L87 Difference]: Start difference. First operand has 202 states, 198 states have (on average 1.297979797979798) internal successors, (257), 201 states have internal predecessors, (257), 0 states have call successors, (0), 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 205 states. [2022-02-20 18:50:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,767 INFO L93 Difference]: Finished difference Result 205 states and 260 transitions. [2022-02-20 18:50:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2022-02-20 18:50:57,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:57,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.297979797979798) internal successors, (257), 201 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call 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:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 257 transitions. [2022-02-20 18:50:57,771 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 257 transitions. Word has length 53 [2022-02-20 18:50:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:57,771 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 257 transitions. [2022-02-20 18:50:57,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call 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:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2022-02-20 18:50:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:50:57,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:57,772 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:50:57,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:50:57,773 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -746268687, now seen corresponding path program 1 times [2022-02-20 18:50:57,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:57,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138798043] [2022-02-20 18:50:57,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:57,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {18449#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {18451#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:57,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {18451#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {18452#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {18453#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {18453#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st2~0; {18453#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {18453#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {18454#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {18455#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:57,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {18455#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18455#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:57,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {18455#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {18455#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:57,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {18455#(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; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {18456#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {18456#(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; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {18456#(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; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 == ~id2~0); {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {18456#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {18456#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18457#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:50:57,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {18457#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {18450#false} is VALID [2022-02-20 18:50:57,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {18450#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {18450#false} is VALID [2022-02-20 18:50:57,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {18450#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18450#false} is VALID [2022-02-20 18:50:57,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {18450#false} assume !(~r1~0 >= 3); {18450#false} is VALID [2022-02-20 18:50:57,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {18450#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1777~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1777~0;havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~6#1;main_~assert__arg~6#1 := main_~__tmp_7~0#1; {18450#false} is VALID [2022-02-20 18:50:57,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {18450#false} assume 0 == main_~assert__arg~6#1 % 256; {18450#false} is VALID [2022-02-20 18:50:57,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {18450#false} assume !false; {18450#false} is VALID [2022-02-20 18:50:57,907 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:57,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:57,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138798043] [2022-02-20 18:50:57,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138798043] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:57,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:57,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:57,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924627567] [2022-02-20 18:50:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:57,909 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:50:57,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:57,909 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:50:57,950 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:50:57,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:57,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:57,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:57,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:57,952 INFO L87 Difference]: Start difference. First operand 202 states and 257 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:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,298 INFO L93 Difference]: Finished difference Result 339 states and 440 transitions. [2022-02-20 18:51:00,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:51:00,299 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:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:00,299 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:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 274 transitions. [2022-02-20 18:51:00,300 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:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 274 transitions. [2022-02-20 18:51:00,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 274 transitions. [2022-02-20 18:51:00,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:00,511 INFO L225 Difference]: With dead ends: 339 [2022-02-20 18:51:00,512 INFO L226 Difference]: Without dead ends: 332 [2022-02-20 18:51:00,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:00,512 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 463 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:00,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 625 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-02-20 18:51:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 198. [2022-02-20 18:51:01,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:01,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 332 states. Second operand has 198 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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:01,208 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand has 198 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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:01,209 INFO L87 Difference]: Start difference. First operand 332 states. Second operand has 198 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:01,213 INFO L93 Difference]: Finished difference Result 332 states and 433 transitions. [2022-02-20 18:51:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 433 transitions. [2022-02-20 18:51:01,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:01,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:01,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 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 332 states. [2022-02-20 18:51:01,214 INFO L87 Difference]: Start difference. First operand has 198 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 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 332 states. [2022-02-20 18:51:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:01,220 INFO L93 Difference]: Finished difference Result 332 states and 433 transitions. [2022-02-20 18:51:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 433 transitions. [2022-02-20 18:51:01,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:01,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:01,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:01,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2022-02-20 18:51:01,224 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 54 [2022-02-20 18:51:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:01,224 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2022-02-20 18:51:01,225 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:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2022-02-20 18:51:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:01,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:01,225 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] [2022-02-20 18:51:01,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:51:01,226 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:01,226 INFO L85 PathProgramCache]: Analyzing trace with hash -11876974, now seen corresponding path program 1 times [2022-02-20 18:51:01,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:01,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377314752] [2022-02-20 18:51:01,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:01,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:01,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {19838#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {19838#true} is VALID [2022-02-20 18:51:01,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {19838#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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {19840#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:01,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {19840#(<= ~send1~0 127)} assume 0 == ~r1~0; {19840#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:01,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {19840#(<= ~send1~0 127)} assume ~id1~0 >= 0; {19841#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:01,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {19841#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume 0 == ~st1~0; {19841#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:01,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {19841#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume ~send1~0 == ~id1~0; {19842#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:01,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {19842#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {19842#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:01,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {19842#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {19843#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:01,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {19843#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {19843#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:01,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {19843#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {19844#(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:01,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {19844#(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; {19844#(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:01,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {19844#(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; {19845#(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:01,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {19845#(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; {19845#(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:01,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {19845#(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; {19846#(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:01,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {19846#(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; {19846#(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:01,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {19846#(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; {19846#(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:01,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {19846#(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; {19846#(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:01,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {19846#(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_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {19846#(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:01,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {19846#(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; {19846#(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:01,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {19846#(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; {19846#(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:01,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {19846#(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; {19846#(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:01,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {19846#(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; {19846#(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:01,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {19846#(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; {19847#(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:01,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {19847#(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; {19847#(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:01,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {19847#(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; {19847#(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:01,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {19847#(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; {19848#(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:01,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {19848#(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; {19848#(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:01,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {19848#(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; {19848#(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:01,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {19848#(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; {19849#(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:01,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {19849#(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; {19849#(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:01,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {19849#(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); {19849#(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:01,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {19849#(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; {19849#(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:01,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {19849#(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_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {19849#(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:01,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {19849#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {19849#(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:01,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {19849#(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)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {19849#(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:01,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {19849#(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; {19849#(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:01,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {19849#(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; {19850#(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:01,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {19850#(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; {19850#(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:01,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {19850#(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); {19851#(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:01,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {19851#(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~3#1;main_~node2__m2~3#1 := ~nomsg~0; {19852#(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:01,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {19852#(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~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19853#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:01,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {19853#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {19853#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:01,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {19853#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {19854#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:01,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {19854#(<= (+ ~p2_old~0 1) ~id3~0)} ~mode2~0 := 0; {19854#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:01,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {19854#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {19854#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:01,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {19854#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19855#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:01,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {19855#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 != ~nomsg~0; {19855#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:01,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {19855#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 > ~id3~0;~send3~0 := main_~node3__m3~4#1; {19839#false} is VALID [2022-02-20 18:51:01,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {19839#false} ~mode3~0 := 0; {19839#false} is VALID [2022-02-20 18:51:01,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {19839#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {19839#false} is VALID [2022-02-20 18:51:01,726 INFO L290 TraceCheckUtils]: 50: Hoare triple {19839#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19839#false} is VALID [2022-02-20 18:51:01,726 INFO L290 TraceCheckUtils]: 51: Hoare triple {19839#false} assume !(~r1~0 >= 3); {19839#false} is VALID [2022-02-20 18:51:01,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {19839#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1777~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1777~0;havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~6#1;main_~assert__arg~6#1 := main_~__tmp_7~0#1; {19839#false} is VALID [2022-02-20 18:51:01,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {19839#false} assume 0 == main_~assert__arg~6#1 % 256; {19839#false} is VALID [2022-02-20 18:51:01,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {19839#false} assume !false; {19839#false} is VALID [2022-02-20 18:51:01,726 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:01,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:01,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377314752] [2022-02-20 18:51:01,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377314752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:01,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:01,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:01,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694196476] [2022-02-20 18:51:01,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:51:01,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:01,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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:01,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:01,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:01,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:01,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:01,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:01,783 INFO L87 Difference]: Start difference. First operand 198 states and 252 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,072 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2022-02-20 18:51:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 18:51:05,073 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:51:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 197 transitions. [2022-02-20 18:51:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 197 transitions. [2022-02-20 18:51:05,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 197 transitions. [2022-02-20 18:51:05,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:05,223 INFO L225 Difference]: With dead ends: 228 [2022-02-20 18:51:05,223 INFO L226 Difference]: Without dead ends: 220 [2022-02-20 18:51:05,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2022-02-20 18:51:05,224 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 323 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:05,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 1476 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:51:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-02-20 18:51:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2022-02-20 18:51:05,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:05,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 203 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 202 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call 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,978 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 203 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 202 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call 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,979 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 203 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 202 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call 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,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,981 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2022-02-20 18:51:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 272 transitions. [2022-02-20 18:51:05,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:05,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:05,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 202 states have internal predecessors, (257), 0 states have call successors, (0), 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 220 states. [2022-02-20 18:51:05,982 INFO L87 Difference]: Start difference. First operand has 203 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 202 states have internal predecessors, (257), 0 states have call successors, (0), 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 220 states. [2022-02-20 18:51:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,986 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2022-02-20 18:51:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 272 transitions. [2022-02-20 18:51:05,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:05,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:05,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:05,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 202 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call 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,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 257 transitions. [2022-02-20 18:51:05,990 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 257 transitions. Word has length 55 [2022-02-20 18:51:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:05,990 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 257 transitions. [2022-02-20 18:51:05,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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,991 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 257 transitions. [2022-02-20 18:51:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:05,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:05,991 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] [2022-02-20 18:51:05,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:51:05,992 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash -637393645, now seen corresponding path program 1 times [2022-02-20 18:51:05,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:05,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204153586] [2022-02-20 18:51:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:05,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:06,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {20871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {20871#true} is VALID [2022-02-20 18:51:06,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {20871#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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {20873#(<= ~id2~0 127)} is VALID [2022-02-20 18:51:06,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {20873#(<= ~id2~0 127)} assume 0 == ~r1~0; {20873#(<= ~id2~0 127)} is VALID [2022-02-20 18:51:06,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {20873#(<= ~id2~0 127)} assume ~id1~0 >= 0; {20874#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:06,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {20874#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {20874#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:06,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {20874#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {20875#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:06,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {20875#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} assume 0 == ~mode1~0 % 256; {20875#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:06,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {20875#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} assume ~id2~0 >= 0; {20876#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {20876#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume 0 == ~st2~0; {20876#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {20876#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {20877#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {20877#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {20877#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {20877#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {20878#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {20878#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {20878#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {20878#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~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; {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {20879#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~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; {20880#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {20880#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {20880#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {20880#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {20880#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:06,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {20880#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~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; {20881#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:51:06,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {20881#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {20881#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:51:06,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {20881#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} assume ~send3~0 != ~nomsg~0; {20881#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:51:06,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {20881#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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; {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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:06,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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; {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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:06,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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); {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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:06,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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; {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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:06,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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:06,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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:06,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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:06,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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; {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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:06,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {20882#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~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; {20883#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~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:06,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {20883#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~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 != ~nomsg~0; {20883#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~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:06,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {20883#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~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;~send1~0 := main_~node1__m1~1#1; {20884#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {20884#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0; {20884#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {20884#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {20884#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {20884#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20885#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {20885#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {20885#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {20885#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {20886#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {20886#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {20887#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:06,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {20887#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20888#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:06,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {20888#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} assume main_~node3__m3~3#1 != ~nomsg~0; {20888#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:06,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {20888#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} assume main_~node3__m3~3#1 > ~id3~0;~send3~0 := main_~node3__m3~3#1; {20872#false} is VALID [2022-02-20 18:51:06,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {20872#false} ~mode3~0 := 0; {20872#false} is VALID [2022-02-20 18:51:06,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {20872#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~4#1; {20872#false} is VALID [2022-02-20 18:51:06,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {20872#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20872#false} is VALID [2022-02-20 18:51:06,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {20872#false} assume !(~r1~0 >= 3); {20872#false} is VALID [2022-02-20 18:51:06,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {20872#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~4#1 := 0;~__return_2046~0 := main_~check__tmp~4#1;main_~main__c1~0#1 := ~__return_2046~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; {20872#false} is VALID [2022-02-20 18:51:06,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {20872#false} assume 0 == main_~assert__arg~4#1 % 256; {20872#false} is VALID [2022-02-20 18:51:06,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {20872#false} assume !false; {20872#false} is VALID [2022-02-20 18:51:06,553 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:06,553 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:06,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204153586] [2022-02-20 18:51:06,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204153586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:06,554 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:06,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:06,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615395863] [2022-02-20 18:51:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:06,554 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:51:06,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:06,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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:06,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:06,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:06,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:06,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:06,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:06,597 INFO L87 Difference]: Start difference. First operand 203 states and 257 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,810 INFO L93 Difference]: Finished difference Result 243 states and 294 transitions. [2022-02-20 18:51:09,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:51:09,810 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:51:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 219 transitions. [2022-02-20 18:51:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 219 transitions. [2022-02-20 18:51:09,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 219 transitions. [2022-02-20 18:51:09,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:09,990 INFO L225 Difference]: With dead ends: 243 [2022-02-20 18:51:09,990 INFO L226 Difference]: Without dead ends: 235 [2022-02-20 18:51:09,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 18:51:09,992 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 478 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:09,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 1396 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:51:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-02-20 18:51:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 206. [2022-02-20 18:51:10,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:10,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 206 states, 202 states have (on average 1.2871287128712872) internal successors, (260), 205 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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,822 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 206 states, 202 states have (on average 1.2871287128712872) internal successors, (260), 205 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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,822 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 206 states, 202 states have (on average 1.2871287128712872) internal successors, (260), 205 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:10,826 INFO L93 Difference]: Finished difference Result 235 states and 286 transitions. [2022-02-20 18:51:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 286 transitions. [2022-02-20 18:51:10,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:10,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:10,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 202 states have (on average 1.2871287128712872) internal successors, (260), 205 states have internal predecessors, (260), 0 states have call successors, (0), 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 235 states. [2022-02-20 18:51:10,827 INFO L87 Difference]: Start difference. First operand has 206 states, 202 states have (on average 1.2871287128712872) internal successors, (260), 205 states have internal predecessors, (260), 0 states have call successors, (0), 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 235 states. [2022-02-20 18:51:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:10,831 INFO L93 Difference]: Finished difference Result 235 states and 286 transitions. [2022-02-20 18:51:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 286 transitions. [2022-02-20 18:51:10,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:10,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:10,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:10,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 202 states have (on average 1.2871287128712872) internal successors, (260), 205 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2022-02-20 18:51:10,836 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 55 [2022-02-20 18:51:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:10,836 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2022-02-20 18:51:10,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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,837 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2022-02-20 18:51:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:10,837 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:10,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:10,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 18:51:10,838 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash -824240014, now seen corresponding path program 1 times [2022-02-20 18:51:10,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:10,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953008128] [2022-02-20 18:51:10,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:10,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:11,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {21964#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1411~0 := 0;~__return_2243~0 := 0;~__tmp_1494_0~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__tmp_1628_0~0 := 0;~__return_1564~0 := 0;~__return_1863~0 := 0;~__return_2046~0 := 0;~__return_2210~0 := 0;~__return_1777~0 := 0;~__return_1932~0 := 0;~__return_2127~0 := 0;~__return_2279~0 := 0;~__return_2174~0 := 0;~__return_2079~0 := 0;~__return_1995~0 := 0;~__return_1896~0 := 0;~__return_1824~0 := 0;~__return_1713~0 := 0;~__return_1484~0 := 0; {21964#true} is VALID [2022-02-20 18:51:11,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {21964#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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#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_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;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; {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {21966#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {21967#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {21967#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {21967#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {21967#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {21968#(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:11,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {21968#(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; {21968#(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:11,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {21968#(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; {21969#(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:11,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {21969#(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; {21969#(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:11,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {21969#(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; {21969#(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:11,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {21969#(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; {21969#(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:11,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {21969#(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; {21969#(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:11,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {21969#(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; {21969#(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:11,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {21969#(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_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {21970#(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:11,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {21970#(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; {21970#(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:11,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {21970#(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; {21970#(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:11,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {21970#(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; {21970#(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:11,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {21970#(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; {21970#(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:11,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {21970#(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; {21970#(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:11,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {21970#(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; {21970#(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:11,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {21970#(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; {21970#(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:11,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {21970#(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; {21971#(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:11,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {21971#(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; {21971#(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:11,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {21971#(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; {21971#(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:11,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {21971#(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; {21972#(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:11,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {21972#(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; {21972#(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:11,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {21972#(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); {21972#(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:11,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {21972#(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; {21972#(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:11,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {21972#(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_2243~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2243~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; {21972#(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:11,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {21972#(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;~__tmp_1494_0~0 := main_~main____CPAchecker_TMP_0~0#1; {21972#(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:11,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {21972#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1494_0~0; {21972#(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:11,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {21972#(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; {21972#(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:11,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {21972#(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; {21972#(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:11,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {21972#(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; {21972#(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:11,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {21972#(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;~send1~0 := main_~node1__m1~1#1; {21972#(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:11,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {21972#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} ~mode1~0 := 0; {21972#(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:11,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {21972#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {21972#(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:11,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {21972#(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; {21972#(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:11,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {21972#(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; {21972#(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:11,189 INFO L290 TraceCheckUtils]: 43: Hoare triple {21972#(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; {21973#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:11,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {21973#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {21973#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:11,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {21973#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {21973#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:11,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {21973#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21974#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:11,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {21974#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {21974#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:11,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {21974#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume !(main_~node3__m3~1#1 > ~id3~0); {21975#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:11,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {21975#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} 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~3#1; {21965#false} is VALID [2022-02-20 18:51:11,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {21965#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21965#false} is VALID [2022-02-20 18:51:11,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {21965#false} assume !(~r1~0 >= 3); {21965#false} is VALID [2022-02-20 18:51:11,191 INFO L290 TraceCheckUtils]: 52: Hoare triple {21965#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1863~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1863~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; {21965#false} is VALID [2022-02-20 18:51:11,191 INFO L290 TraceCheckUtils]: 53: Hoare triple {21965#false} assume 0 == main_~assert__arg~3#1 % 256; {21965#false} is VALID [2022-02-20 18:51:11,191 INFO L290 TraceCheckUtils]: 54: Hoare triple {21965#false} assume !false; {21965#false} is VALID [2022-02-20 18:51:11,192 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:11,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:11,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953008128] [2022-02-20 18:51:11,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953008128] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:11,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:11,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:11,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069807906] [2022-02-20 18:51:11,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:51:11,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:11,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call 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:11,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:11,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:11,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:11,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:11,240 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)