./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a17c5e6b377f57a67eda09046c4807c6b84e7806fd109e4ef14e9498a7cb447 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:52:35,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:52:35,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:52:35,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:52:35,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:52:35,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:52:35,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:52:35,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:52:35,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:52:35,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:52:35,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:52:35,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:52:35,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:52:35,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:52:35,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:52:35,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:52:35,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:52:35,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:52:35,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:52:35,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:52:35,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:52:35,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:52:35,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:52:35,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:52:35,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:52:35,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:52:35,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:52:35,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:52:35,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:52:35,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:52:35,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:52:35,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:52:35,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:52:35,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:52:35,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:52:35,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:52:35,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:52:35,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:52:35,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:52:35,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:52:35,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:52:35,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:52:35,139 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:52:35,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:52:35,140 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:52:35,140 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:52:35,141 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:52:35,141 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:52:35,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:52:35,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:52:35,141 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:52:35,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:52:35,142 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:52:35,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:52:35,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:52:35,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:52:35,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:52:35,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:52:35,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:52:35,143 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:52:35,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:52:35,144 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:52:35,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:52:35,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:52:35,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:52:35,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:52:35,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:35,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:52:35,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:52:35,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:52:35,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:52:35,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:52:35,145 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:52:35,146 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:52:35,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:52:35,146 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 -> 5a17c5e6b377f57a67eda09046c4807c6b84e7806fd109e4ef14e9498a7cb447 [2022-02-20 18:52:35,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:52:35,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:52:35,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:52:35,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:52:35,312 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:52:35,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-02-20 18:52:35,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d5cfada/5c7a8ba598284589a405d1574a08742e/FLAG90051b053 [2022-02-20 18:52:35,785 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:52:35,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-02-20 18:52:35,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d5cfada/5c7a8ba598284589a405d1574a08742e/FLAG90051b053 [2022-02-20 18:52:35,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d5cfada/5c7a8ba598284589a405d1574a08742e [2022-02-20 18:52:35,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:52:35,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:52:35,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:35,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:52:35,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:52:35,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:35" (1/1) ... [2022-02-20 18:52:35,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47599ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:35, skipping insertion in model container [2022-02-20 18:52:35,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:35" (1/1) ... [2022-02-20 18:52:35,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:52:35,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:52:36,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16906,16919] [2022-02-20 18:52:36,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23310,23323] [2022-02-20 18:52:36,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26497,26510] [2022-02-20 18:52:36,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29453,29466] [2022-02-20 18:52:36,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33216,33229] [2022-02-20 18:52:36,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36248,36261] [2022-02-20 18:52:36,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39433,39446] [2022-02-20 18:52:36,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42384,42397] [2022-02-20 18:52:36,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45768,45781] [2022-02-20 18:52:36,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48734,48747] [2022-02-20 18:52:36,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[51883,51896] [2022-02-20 18:52:36,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:36,224 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:52:36,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16906,16919] [2022-02-20 18:52:36,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23310,23323] [2022-02-20 18:52:36,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26497,26510] [2022-02-20 18:52:36,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29453,29466] [2022-02-20 18:52:36,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33216,33229] [2022-02-20 18:52:36,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36248,36261] [2022-02-20 18:52:36,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39433,39446] [2022-02-20 18:52:36,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42384,42397] [2022-02-20 18:52:36,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45768,45781] [2022-02-20 18:52:36,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48734,48747] [2022-02-20 18:52:36,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[51883,51896] [2022-02-20 18:52:36,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:36,425 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:52:36,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36 WrapperNode [2022-02-20 18:52:36,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:36,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:36,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:52:36,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:52:36,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (1/1) ... [2022-02-20 18:52:36,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (1/1) ... [2022-02-20 18:52:36,522 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2571 [2022-02-20 18:52:36,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:36,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:52:36,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:52:36,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:52:36,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (1/1) ... [2022-02-20 18:52:36,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (1/1) ... [2022-02-20 18:52:36,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (1/1) ... [2022-02-20 18:52:36,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (1/1) ... [2022-02-20 18:52:36,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:52:36" (1/1) ... [2022-02-20 18:52:36,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (1/1) ... [2022-02-20 18:52:36,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (1/1) ... [2022-02-20 18:52:36,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:52:36,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:52:36,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:52:36,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:52:36,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (1/1) ... [2022-02-20 18:52:36,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:36,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:52:36,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:52:36,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:52:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:52:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:52:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:52:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:52:36,803 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:52:36,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:52:37,895 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:52:37,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:52:37,922 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:52:37,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:37 BoogieIcfgContainer [2022-02-20 18:52:37,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:52:37,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:52:37,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:52:37,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:52:37,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:52:35" (1/3) ... [2022-02-20 18:52:37,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d96600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:37, skipping insertion in model container [2022-02-20 18:52:37,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:36" (2/3) ... [2022-02-20 18:52:37,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d96600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:37, skipping insertion in model container [2022-02-20 18:52:37,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:37" (3/3) ... [2022-02-20 18:52:37,933 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-02-20 18:52:37,938 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:52:37,938 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-20 18:52:37,985 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:52:37,990 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:52:37,990 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-20 18:52:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 537 states, 525 states have (on average 1.8304761904761904) internal successors, (961), 536 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:52:38,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:38,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:38,039 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:38,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:38,043 INFO L85 PathProgramCache]: Analyzing trace with hash 702631990, now seen corresponding path program 1 times [2022-02-20 18:52:38,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:38,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463404397] [2022-02-20 18:52:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:38,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {540#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:38,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {542#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {543#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:38,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {543#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {543#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:38,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {543#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~1#1; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~1#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~1#1 % 256 else main_~node3____CPAchecker_TMP_0~1#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~9#1;main_~node4__m4~9#1 := ~nomsg~0; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~3#1; {544#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:38,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {544#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~3#1 := ~p4_new~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~3#1 % 256 else main_~node4____CPAchecker_TMP_0~3#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~14#1; {541#false} is VALID [2022-02-20 18:52:38,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {541#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {541#false} is VALID [2022-02-20 18:52:38,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {541#false} assume !(~r1~0 % 256 >= 4); {541#false} is VALID [2022-02-20 18:52:38,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {541#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {541#false} is VALID [2022-02-20 18:52:38,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {541#false} assume ~r1~0 % 256 < 4;main_~check__tmp~14#1 := 1;~__return_703~0 := main_~check__tmp~14#1;main_~main__c1~0#1 := ~__return_703~0;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~10#1;main_~assert__arg~10#1 := main_~__tmp_11~0#1; {541#false} is VALID [2022-02-20 18:52:38,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {541#false} assume !(0 == main_~assert__arg~10#1 % 256);havoc main_~node1__m1~8#1;main_~node1__m1~8#1 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:52:38,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {541#false} assume !(0 == ~mode1~0 % 256); {541#false} is VALID [2022-02-20 18:52:38,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {541#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~8#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:52:38,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {541#false} assume !(main_~node1__m1~8#1 != ~nomsg~0);~mode1~0 := 0; {541#false} is VALID [2022-02-20 18:52:38,422 INFO L290 TraceCheckUtils]: 43: Hoare triple {541#false} havoc main_~node2__m2~8#1;main_~node2__m2~8#1 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:52:38,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {541#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~8#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:52:38,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {541#false} assume main_~node2__m2~8#1 != ~nomsg~0; {541#false} is VALID [2022-02-20 18:52:38,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {541#false} assume !(main_~node2__m2~8#1 > ~id2~0); {541#false} is VALID [2022-02-20 18:52:38,423 INFO L290 TraceCheckUtils]: 47: Hoare triple {541#false} assume main_~node2__m2~8#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~9#1;main_~node3__m3~9#1 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:52:38,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {541#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~9#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:52:38,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {541#false} assume !(main_~node3__m3~9#1 != ~nomsg~0);~mode3~0 := 0; {541#false} is VALID [2022-02-20 18:52:38,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {541#false} havoc main_~node4__m4~11#1;main_~node4__m4~11#1 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:52:38,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {541#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~11#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:52:38,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {541#false} assume !(main_~node4__m4~11#1 != ~nomsg~0);~mode4~0 := 0; {541#false} is VALID [2022-02-20 18:52:38,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {541#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~15#1; {541#false} is VALID [2022-02-20 18:52:38,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {541#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {541#false} is VALID [2022-02-20 18:52:38,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {541#false} assume !(~r1~0 % 256 >= 4); {541#false} is VALID [2022-02-20 18:52:38,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {541#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~15#1 := 0;~__return_1784~0 := main_~check__tmp~15#1;main_~main__c1~0#1 := ~__return_1784~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; {541#false} is VALID [2022-02-20 18:52:38,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {541#false} assume 0 == main_~assert__arg~11#1 % 256; {541#false} is VALID [2022-02-20 18:52:38,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {541#false} assume !false; {541#false} is VALID [2022-02-20 18:52:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:38,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:38,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463404397] [2022-02-20 18:52:38,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463404397] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:38,436 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:38,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:38,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937678993] [2022-02-20 18:52:38,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:38,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:38,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:38,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:38,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:38,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:38,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:38,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:38,513 INFO L87 Difference]: Start difference. First operand has 537 states, 525 states have (on average 1.8304761904761904) internal successors, (961), 536 states have internal predecessors, (961), 0 states have call successors, (0), 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 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:39,965 INFO L93 Difference]: Finished difference Result 740 states and 1288 transitions. [2022-02-20 18:52:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:39,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1288 transitions. [2022-02-20 18:52:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1288 transitions. [2022-02-20 18:52:40,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1288 transitions. [2022-02-20 18:52:40,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1288 edges. 1288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:40,841 INFO L225 Difference]: With dead ends: 740 [2022-02-20 18:52:40,841 INFO L226 Difference]: Without dead ends: 470 [2022-02-20 18:52:40,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:40,847 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 2316 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:40,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2316 Valid, 518 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-02-20 18:52:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-02-20 18:52:41,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:41,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 470 states. Second operand has 470 states, 459 states have (on average 1.2962962962962963) internal successors, (595), 469 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,015 INFO L74 IsIncluded]: Start isIncluded. First operand 470 states. Second operand has 470 states, 459 states have (on average 1.2962962962962963) internal successors, (595), 469 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,016 INFO L87 Difference]: Start difference. First operand 470 states. Second operand has 470 states, 459 states have (on average 1.2962962962962963) internal successors, (595), 469 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:41,029 INFO L93 Difference]: Finished difference Result 470 states and 595 transitions. [2022-02-20 18:52:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 595 transitions. [2022-02-20 18:52:41,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:41,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:41,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 470 states, 459 states have (on average 1.2962962962962963) internal successors, (595), 469 states have internal predecessors, (595), 0 states have call successors, (0), 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 470 states. [2022-02-20 18:52:41,033 INFO L87 Difference]: Start difference. First operand has 470 states, 459 states have (on average 1.2962962962962963) internal successors, (595), 469 states have internal predecessors, (595), 0 states have call successors, (0), 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 470 states. [2022-02-20 18:52:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:41,045 INFO L93 Difference]: Finished difference Result 470 states and 595 transitions. [2022-02-20 18:52:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 595 transitions. [2022-02-20 18:52:41,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:41,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:41,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:41,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 459 states have (on average 1.2962962962962963) internal successors, (595), 469 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 595 transitions. [2022-02-20 18:52:41,062 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 595 transitions. Word has length 59 [2022-02-20 18:52:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:41,062 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 595 transitions. [2022-02-20 18:52:41,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 595 transitions. [2022-02-20 18:52:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:52:41,064 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:41,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:41,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:52:41,064 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash 728409025, now seen corresponding path program 1 times [2022-02-20 18:52:41,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:41,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740996913] [2022-02-20 18:52:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:41,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {2931#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {2933#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:41,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {2933#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {2933#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:41,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {2933#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {2933#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:41,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {2933#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2933#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:41,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {2933#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {2933#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:41,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {2933#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {2933#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:41,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {2933#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {2933#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:41,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {2933#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {2934#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:41,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {2934#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {2934#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:41,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {2934#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {2935#(<= (+ ~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; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2935#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:41,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {2935#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {2932#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~1#1; {2932#false} is VALID [2022-02-20 18:52:41,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {2932#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~1#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~1#1 % 256 else main_~node3____CPAchecker_TMP_0~1#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~9#1;main_~node4__m4~9#1 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {2932#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~3#1; {2932#false} is VALID [2022-02-20 18:52:41,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {2932#false} assume ~send4~0 != ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {2932#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~3#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~3#1 % 256 else main_~node4____CPAchecker_TMP_0~3#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~12#1; {2932#false} is VALID [2022-02-20 18:52:41,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {2932#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2932#false} is VALID [2022-02-20 18:52:41,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {2932#false} assume !(~r1~0 % 256 >= 4); {2932#false} is VALID [2022-02-20 18:52:41,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {2932#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {2932#false} is VALID [2022-02-20 18:52:41,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {2932#false} assume ~r1~0 % 256 < 4;main_~check__tmp~12#1 := 1;~__return_717~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_717~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; {2932#false} is VALID [2022-02-20 18:52:41,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {2932#false} assume !(0 == main_~assert__arg~8#1 % 256);havoc main_~node1__m1~7#1;main_~node1__m1~7#1 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {2932#false} assume !(0 == ~mode1~0 % 256); {2932#false} is VALID [2022-02-20 18:52:41,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {2932#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~7#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {2932#false} assume main_~node1__m1~7#1 != ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {2932#false} assume !(main_~node1__m1~7#1 > ~id1~0); {2932#false} is VALID [2022-02-20 18:52:41,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {2932#false} assume main_~node1__m1~7#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~7#1;main_~node2__m2~7#1 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {2932#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~7#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {2932#false} assume main_~node2__m2~7#1 != ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {2932#false} assume !(main_~node2__m2~7#1 > ~id2~0); {2932#false} is VALID [2022-02-20 18:52:41,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {2932#false} assume main_~node2__m2~7#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {2932#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {2932#false} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0; {2932#false} is VALID [2022-02-20 18:52:41,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {2932#false} havoc main_~node4__m4~10#1;main_~node4__m4~10#1 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {2932#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~10#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2932#false} is VALID [2022-02-20 18:52:41,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {2932#false} assume !(main_~node4__m4~10#1 != ~nomsg~0);~mode4~0 := 0; {2932#false} is VALID [2022-02-20 18:52:41,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {2932#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~13#1; {2932#false} is VALID [2022-02-20 18:52:41,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {2932#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~13#1 := 0;~__return_1891~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_1891~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; {2932#false} is VALID [2022-02-20 18:52:41,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {2932#false} assume 0 == main_~assert__arg~9#1 % 256; {2932#false} is VALID [2022-02-20 18:52:41,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {2932#false} assume !false; {2932#false} is VALID [2022-02-20 18:52:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:41,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:41,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740996913] [2022-02-20 18:52:41,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740996913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:41,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:41,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:41,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714754626] [2022-02-20 18:52:41,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:41,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:41,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:41,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:41,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:41,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:41,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:41,198 INFO L87 Difference]: Start difference. First operand 470 states and 595 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:41,985 INFO L93 Difference]: Finished difference Result 600 states and 761 transitions. [2022-02-20 18:52:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:41,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2022-02-20 18:52:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2022-02-20 18:52:41,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 761 transitions. [2022-02-20 18:52:42,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 761 edges. 761 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:42,474 INFO L225 Difference]: With dead ends: 600 [2022-02-20 18:52:42,474 INFO L226 Difference]: Without dead ends: 356 [2022-02-20 18:52:42,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:42,476 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 1295 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:42,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1295 Valid, 243 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-02-20 18:52:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-02-20 18:52:42,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:42,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,633 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,633 INFO L87 Difference]: Start difference. First operand 356 states. Second operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:42,641 INFO L93 Difference]: Finished difference Result 356 states and 452 transitions. [2022-02-20 18:52:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 452 transitions. [2022-02-20 18:52:42,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:42,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:42,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 356 states. [2022-02-20 18:52:42,643 INFO L87 Difference]: Start difference. First operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 356 states. [2022-02-20 18:52:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:42,651 INFO L93 Difference]: Finished difference Result 356 states and 452 transitions. [2022-02-20 18:52:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 452 transitions. [2022-02-20 18:52:42,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:42,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:42,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:42,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 452 transitions. [2022-02-20 18:52:42,660 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 452 transitions. Word has length 59 [2022-02-20 18:52:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:42,660 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 452 transitions. [2022-02-20 18:52:42,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,661 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 452 transitions. [2022-02-20 18:52:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:52:42,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:42,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:42,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:52:42,662 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash -466198780, now seen corresponding path program 1 times [2022-02-20 18:52:42,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:42,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194196638] [2022-02-20 18:52:42,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:42,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:42,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {4804#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {4806#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:42,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {4806#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {4806#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:42,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {4806#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {4806#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:42,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {4806#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {4807#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:42,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {4807#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {4807#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:42,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {4807#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4808#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:42,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {4808#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~9#1;main_~node2__m2~9#1 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {4805#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~1#1; {4805#false} is VALID [2022-02-20 18:52:42,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {4805#false} assume ~send2~0 != ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {4805#false} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~1#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~1#1 % 256 else main_~node2____CPAchecker_TMP_0~1#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~10#1;main_~node3__m3~10#1 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {4805#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {4805#false} is VALID [2022-02-20 18:52:42,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {4805#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~2#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~15#1;main_~node4__m4~15#1 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {4805#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~5#1; {4805#false} is VALID [2022-02-20 18:52:42,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {4805#false} assume ~send4~0 != ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {4805#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~5#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~5#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~5#1 % 256 else main_~node4____CPAchecker_TMP_0~5#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~20#1; {4805#false} is VALID [2022-02-20 18:52:42,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {4805#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {4805#false} is VALID [2022-02-20 18:52:42,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {4805#false} assume !(~r1~0 % 256 >= 4); {4805#false} is VALID [2022-02-20 18:52:42,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {4805#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {4805#false} is VALID [2022-02-20 18:52:42,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {4805#false} assume ~r1~0 % 256 < 4;main_~check__tmp~20#1 := 1;~__return_661~0 := main_~check__tmp~20#1;main_~main__c1~0#1 := ~__return_661~0;havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~16#1;main_~assert__arg~16#1 := main_~__tmp_17~0#1; {4805#false} is VALID [2022-02-20 18:52:42,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {4805#false} assume !(0 == main_~assert__arg~16#1 % 256);havoc main_~node1__m1~11#1;main_~node1__m1~11#1 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {4805#false} assume !(0 == ~mode1~0 % 256); {4805#false} is VALID [2022-02-20 18:52:42,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {4805#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~11#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {4805#false} assume main_~node1__m1~11#1 != ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {4805#false} assume !(main_~node1__m1~11#1 > ~id1~0); {4805#false} is VALID [2022-02-20 18:52:42,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {4805#false} assume main_~node1__m1~11#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~12#1;main_~node2__m2~12#1 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {4805#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~12#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {4805#false} assume !(main_~node2__m2~12#1 != ~nomsg~0);~mode2~0 := 0; {4805#false} is VALID [2022-02-20 18:52:42,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {4805#false} havoc main_~node3__m3~13#1;main_~node3__m3~13#1 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {4805#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~13#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {4805#false} assume main_~node3__m3~13#1 != ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {4805#false} assume !(main_~node3__m3~13#1 > ~id3~0); {4805#false} is VALID [2022-02-20 18:52:42,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {4805#false} assume main_~node3__m3~13#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~16#1;main_~node4__m4~16#1 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,747 INFO L290 TraceCheckUtils]: 53: Hoare triple {4805#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~16#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4805#false} is VALID [2022-02-20 18:52:42,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {4805#false} assume !(main_~node4__m4~16#1 != ~nomsg~0);~mode4~0 := 0; {4805#false} is VALID [2022-02-20 18:52:42,747 INFO L290 TraceCheckUtils]: 55: Hoare triple {4805#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~21#1; {4805#false} is VALID [2022-02-20 18:52:42,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {4805#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~21#1 := 0;~__return_1451~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_1451~0;havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~17#1;main_~assert__arg~17#1 := main_~__tmp_18~0#1; {4805#false} is VALID [2022-02-20 18:52:42,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {4805#false} assume 0 == main_~assert__arg~17#1 % 256; {4805#false} is VALID [2022-02-20 18:52:42,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {4805#false} assume !false; {4805#false} is VALID [2022-02-20 18:52:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:42,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:42,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194196638] [2022-02-20 18:52:42,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194196638] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:42,748 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:42,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:42,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809512317] [2022-02-20 18:52:42,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:42,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:42,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:42,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:42,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:42,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:42,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:42,782 INFO L87 Difference]: Start difference. First operand 356 states and 452 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:43,540 INFO L93 Difference]: Finished difference Result 506 states and 651 transitions. [2022-02-20 18:52:43,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:43,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2022-02-20 18:52:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2022-02-20 18:52:43,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 651 transitions. [2022-02-20 18:52:43,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 651 edges. 651 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:43,954 INFO L225 Difference]: With dead ends: 506 [2022-02-20 18:52:43,954 INFO L226 Difference]: Without dead ends: 312 [2022-02-20 18:52:43,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:43,955 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 1153 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:43,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1153 Valid, 219 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-02-20 18:52:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-02-20 18:52:44,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:44,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 312 states, 301 states have (on average 1.3255813953488371) internal successors, (399), 311 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,162 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 312 states, 301 states have (on average 1.3255813953488371) internal successors, (399), 311 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,163 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 312 states, 301 states have (on average 1.3255813953488371) internal successors, (399), 311 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,168 INFO L93 Difference]: Finished difference Result 312 states and 399 transitions. [2022-02-20 18:52:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 399 transitions. [2022-02-20 18:52:44,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:44,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:44,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 312 states, 301 states have (on average 1.3255813953488371) internal successors, (399), 311 states have internal predecessors, (399), 0 states have call successors, (0), 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 312 states. [2022-02-20 18:52:44,169 INFO L87 Difference]: Start difference. First operand has 312 states, 301 states have (on average 1.3255813953488371) internal successors, (399), 311 states have internal predecessors, (399), 0 states have call successors, (0), 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 312 states. [2022-02-20 18:52:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,174 INFO L93 Difference]: Finished difference Result 312 states and 399 transitions. [2022-02-20 18:52:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 399 transitions. [2022-02-20 18:52:44,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:44,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:44,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:44,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 301 states have (on average 1.3255813953488371) internal successors, (399), 311 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 399 transitions. [2022-02-20 18:52:44,181 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 399 transitions. Word has length 59 [2022-02-20 18:52:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:44,181 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 399 transitions. [2022-02-20 18:52:44,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 399 transitions. [2022-02-20 18:52:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:52:44,182 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:44,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:44,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:52:44,183 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1447561490, now seen corresponding path program 1 times [2022-02-20 18:52:44,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:44,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720080620] [2022-02-20 18:52:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:44,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {6435#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {6437#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {6437#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {6438#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:44,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {6438#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {6438#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:44,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {6438#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {6439#(<= (+ ~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; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {6439#(<= (+ ~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; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6439#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:44,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {6439#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {6436#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~1#1; {6436#false} is VALID [2022-02-20 18:52:44,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {6436#false} assume ~send4~0 != ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {6436#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~1#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~1#1 % 256 else main_~node4____CPAchecker_TMP_0~1#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~4#1; {6436#false} is VALID [2022-02-20 18:52:44,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {6436#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6436#false} is VALID [2022-02-20 18:52:44,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {6436#false} assume !(~r1~0 % 256 >= 4); {6436#false} is VALID [2022-02-20 18:52:44,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {6436#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {6436#false} is VALID [2022-02-20 18:52:44,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {6436#false} assume ~r1~0 % 256 < 4;main_~check__tmp~4#1 := 1;~__return_773~0 := main_~check__tmp~4#1;main_~main__c1~0#1 := ~__return_773~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {6436#false} is VALID [2022-02-20 18:52:44,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {6436#false} assume !(0 == main_~assert__arg~2#1 % 256);havoc main_~node1__m1~3#1;main_~node1__m1~3#1 := ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {6436#false} assume !(0 == ~mode1~0 % 256); {6436#false} is VALID [2022-02-20 18:52:44,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {6436#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~3#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {6436#false} assume !(main_~node1__m1~3#1 != ~nomsg~0);~mode1~0 := 0; {6436#false} is VALID [2022-02-20 18:52:44,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {6436#false} havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {6436#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~4#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,259 INFO L290 TraceCheckUtils]: 47: Hoare triple {6436#false} assume main_~node2__m2~4#1 != ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,259 INFO L290 TraceCheckUtils]: 48: Hoare triple {6436#false} assume !(main_~node2__m2~4#1 > ~id2~0); {6436#false} is VALID [2022-02-20 18:52:44,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {6436#false} assume main_~node2__m2~4#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {6436#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {6436#false} assume main_~node3__m3~4#1 != ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {6436#false} assume !(main_~node3__m3~4#1 > ~id3~0); {6436#false} is VALID [2022-02-20 18:52:44,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {6436#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~5#1;main_~node4__m4~5#1 := ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {6436#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6436#false} is VALID [2022-02-20 18:52:44,260 INFO L290 TraceCheckUtils]: 55: Hoare triple {6436#false} assume !(main_~node4__m4~5#1 != ~nomsg~0);~mode4~0 := 0; {6436#false} is VALID [2022-02-20 18:52:44,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {6436#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {6436#false} is VALID [2022-02-20 18:52:44,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {6436#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_2224~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_2224~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; {6436#false} is VALID [2022-02-20 18:52:44,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {6436#false} assume 0 == main_~assert__arg~4#1 % 256; {6436#false} is VALID [2022-02-20 18:52:44,261 INFO L290 TraceCheckUtils]: 59: Hoare triple {6436#false} assume !false; {6436#false} is VALID [2022-02-20 18:52:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:44,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:44,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720080620] [2022-02-20 18:52:44,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720080620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:44,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:44,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:44,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920258090] [2022-02-20 18:52:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:44,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:52:44,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:44,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:44,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:44,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:44,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:44,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:44,296 INFO L87 Difference]: Start difference. First operand 312 states and 399 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,947 INFO L93 Difference]: Finished difference Result 410 states and 519 transitions. [2022-02-20 18:52:44,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:44,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:52:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2022-02-20 18:52:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2022-02-20 18:52:44,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 519 transitions. [2022-02-20 18:52:45,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 519 edges. 519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:45,258 INFO L225 Difference]: With dead ends: 410 [2022-02-20 18:52:45,258 INFO L226 Difference]: Without dead ends: 245 [2022-02-20 18:52:45,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:45,259 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 855 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:45,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [855 Valid, 195 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-02-20 18:52:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-02-20 18:52:45,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:45,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 245 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 244 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,481 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 245 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 244 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,481 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 245 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 244 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:45,485 INFO L93 Difference]: Finished difference Result 245 states and 309 transitions. [2022-02-20 18:52:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 309 transitions. [2022-02-20 18:52:45,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:45,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:45,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 244 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 245 states. [2022-02-20 18:52:45,486 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 244 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 245 states. [2022-02-20 18:52:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:45,490 INFO L93 Difference]: Finished difference Result 245 states and 309 transitions. [2022-02-20 18:52:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 309 transitions. [2022-02-20 18:52:45,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:45,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:45,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:45,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 244 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 309 transitions. [2022-02-20 18:52:45,495 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 309 transitions. Word has length 60 [2022-02-20 18:52:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:45,496 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 309 transitions. [2022-02-20 18:52:45,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 309 transitions. [2022-02-20 18:52:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:52:45,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:45,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:45,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:52:45,498 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash -944801897, now seen corresponding path program 1 times [2022-02-20 18:52:45,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:45,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699722599] [2022-02-20 18:52:45,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:45,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {7739#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {7741#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:45,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {7741#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {7742#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {7743#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {7743#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {7743#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:45,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {7743#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:45,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {7744#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {7745#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {7745#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {7745#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {7745#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {7745#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {7745#(not (= ~p3_new~0 ~nomsg~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~1#1 != ~nomsg~0);~mode3~0 := 0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {7746#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {7746#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7747#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} is VALID [2022-02-20 18:52:45,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {7747#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {7740#false} is VALID [2022-02-20 18:52:45,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {7740#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~13#1; {7740#false} is VALID [2022-02-20 18:52:45,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {7740#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~13#1 := 0;~__return_1891~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_1891~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; {7740#false} is VALID [2022-02-20 18:52:45,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {7740#false} assume 0 == main_~assert__arg~9#1 % 256; {7740#false} is VALID [2022-02-20 18:52:45,697 INFO L290 TraceCheckUtils]: 60: Hoare triple {7740#false} assume !false; {7740#false} is VALID [2022-02-20 18:52:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:45,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:45,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699722599] [2022-02-20 18:52:45,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699722599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:45,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:45,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:45,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763885061] [2022-02-20 18:52:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:45,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:45,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:45,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:45,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:45,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:45,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:45,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:45,748 INFO L87 Difference]: Start difference. First operand 245 states and 309 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,029 INFO L93 Difference]: Finished difference Result 484 states and 632 transitions. [2022-02-20 18:52:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:48,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 632 transitions. [2022-02-20 18:52:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 632 transitions. [2022-02-20 18:52:48,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 632 transitions. [2022-02-20 18:52:48,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:48,509 INFO L225 Difference]: With dead ends: 484 [2022-02-20 18:52:48,509 INFO L226 Difference]: Without dead ends: 479 [2022-02-20 18:52:48,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:48,510 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 986 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:48,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [986 Valid, 921 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-02-20 18:52:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 245. [2022-02-20 18:52:48,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:48,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 244 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,781 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 244 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,781 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 244 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,790 INFO L93 Difference]: Finished difference Result 479 states and 626 transitions. [2022-02-20 18:52:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 626 transitions. [2022-02-20 18:52:48,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:48,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:48,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 244 states have internal predecessors, (308), 0 states have call successors, (0), 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 479 states. [2022-02-20 18:52:48,792 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 244 states have internal predecessors, (308), 0 states have call successors, (0), 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 479 states. [2022-02-20 18:52:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,802 INFO L93 Difference]: Finished difference Result 479 states and 626 transitions. [2022-02-20 18:52:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 626 transitions. [2022-02-20 18:52:48,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:48,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:48,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:48,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 244 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 308 transitions. [2022-02-20 18:52:48,807 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 308 transitions. Word has length 61 [2022-02-20 18:52:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:48,807 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 308 transitions. [2022-02-20 18:52:48,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 308 transitions. [2022-02-20 18:52:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:52:48,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:48,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:48,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:52:48,808 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 448084895, now seen corresponding path program 1 times [2022-02-20 18:52:48,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:48,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713336424] [2022-02-20 18:52:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:48,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:48,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {9652#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {9654#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:48,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {9654#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {9655#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:48,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {9655#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {9655#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:48,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {9655#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {9656#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:48,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {9656#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {9656#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:48,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {9656#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:48,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {9657#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {9658#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:48,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {9658#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {9658#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:48,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {9658#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {9658#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:48,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {9658#(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; {9658#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:48,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {9658#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {9658#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:48,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {9658#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {9658#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:48,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {9658#(not (= ~nomsg~0 ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {9658#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:48,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {9658#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {9658#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:48,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {9658#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {9658#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:48,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {9658#(not (= ~nomsg~0 ~p1_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 4); {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,930 INFO L290 TraceCheckUtils]: 47: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {9659#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:48,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {9659#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9660#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:52:48,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {9660#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {9653#false} is VALID [2022-02-20 18:52:48,931 INFO L290 TraceCheckUtils]: 50: Hoare triple {9653#false} havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {9653#false} is VALID [2022-02-20 18:52:48,931 INFO L290 TraceCheckUtils]: 51: Hoare triple {9653#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9653#false} is VALID [2022-02-20 18:52:48,932 INFO L290 TraceCheckUtils]: 52: Hoare triple {9653#false} assume !(main_~node3__m3~11#1 != ~nomsg~0);~mode3~0 := 0; {9653#false} is VALID [2022-02-20 18:52:48,932 INFO L290 TraceCheckUtils]: 53: Hoare triple {9653#false} havoc main_~node4__m4~19#1;main_~node4__m4~19#1 := ~nomsg~0; {9653#false} is VALID [2022-02-20 18:52:48,932 INFO L290 TraceCheckUtils]: 54: Hoare triple {9653#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~19#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9653#false} is VALID [2022-02-20 18:52:48,932 INFO L290 TraceCheckUtils]: 55: Hoare triple {9653#false} assume main_~node4__m4~19#1 != ~nomsg~0; {9653#false} is VALID [2022-02-20 18:52:48,932 INFO L290 TraceCheckUtils]: 56: Hoare triple {9653#false} assume !(main_~node4__m4~19#1 > ~id4~0); {9653#false} is VALID [2022-02-20 18:52:48,932 INFO L290 TraceCheckUtils]: 57: Hoare triple {9653#false} assume main_~node4__m4~19#1 == ~id4~0;~st4~0 := 1;~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~25#1; {9653#false} is VALID [2022-02-20 18:52:48,932 INFO L290 TraceCheckUtils]: 58: Hoare triple {9653#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~25#1 := 0;~__return_1248~0 := main_~check__tmp~25#1;main_~main__c1~0#1 := ~__return_1248~0;havoc main_~__tmp_22~0#1;main_~__tmp_22~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~21#1;main_~assert__arg~21#1 := main_~__tmp_22~0#1; {9653#false} is VALID [2022-02-20 18:52:48,933 INFO L290 TraceCheckUtils]: 59: Hoare triple {9653#false} assume 0 == main_~assert__arg~21#1 % 256; {9653#false} is VALID [2022-02-20 18:52:48,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {9653#false} assume !false; {9653#false} is VALID [2022-02-20 18:52:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:48,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:48,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713336424] [2022-02-20 18:52:48,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713336424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:48,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:48,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:48,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521528897] [2022-02-20 18:52:48,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:48,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:48,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:48,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:48,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:48,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:48,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:48,979 INFO L87 Difference]: Start difference. First operand 245 states and 308 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:51,513 INFO L93 Difference]: Finished difference Result 579 states and 770 transitions. [2022-02-20 18:52:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:51,514 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 770 transitions. [2022-02-20 18:52:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 770 transitions. [2022-02-20 18:52:51,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 770 transitions. [2022-02-20 18:52:52,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 770 edges. 770 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:52,036 INFO L225 Difference]: With dead ends: 579 [2022-02-20 18:52:52,036 INFO L226 Difference]: Without dead ends: 491 [2022-02-20 18:52:52,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:52,037 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 1559 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:52,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 874 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-02-20 18:52:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 245. [2022-02-20 18:52:52,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:52,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand has 245 states, 234 states have (on average 1.311965811965812) internal successors, (307), 244 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,392 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand has 245 states, 234 states have (on average 1.311965811965812) internal successors, (307), 244 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,392 INFO L87 Difference]: Start difference. First operand 491 states. Second operand has 245 states, 234 states have (on average 1.311965811965812) internal successors, (307), 244 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,403 INFO L93 Difference]: Finished difference Result 491 states and 647 transitions. [2022-02-20 18:52:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 647 transitions. [2022-02-20 18:52:52,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:52,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:52,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.311965811965812) internal successors, (307), 244 states have internal predecessors, (307), 0 states have call successors, (0), 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 491 states. [2022-02-20 18:52:52,405 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.311965811965812) internal successors, (307), 244 states have internal predecessors, (307), 0 states have call successors, (0), 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 491 states. [2022-02-20 18:52:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,416 INFO L93 Difference]: Finished difference Result 491 states and 647 transitions. [2022-02-20 18:52:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 647 transitions. [2022-02-20 18:52:52,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:52,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:52,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:52,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.311965811965812) internal successors, (307), 244 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 307 transitions. [2022-02-20 18:52:52,421 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 307 transitions. Word has length 61 [2022-02-20 18:52:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:52,422 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 307 transitions. [2022-02-20 18:52:52,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 307 transitions. [2022-02-20 18:52:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:52:52,423 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:52,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:52,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:52,423 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:52,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1014019097, now seen corresponding path program 1 times [2022-02-20 18:52:52,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:52,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135088668] [2022-02-20 18:52:52,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:52,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:52,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {11712#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {11714#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:52,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {11714#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {11715#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {11716#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} is VALID [2022-02-20 18:52:52,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {11716#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} assume 0 == ~st4~0; {11716#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} is VALID [2022-02-20 18:52:52,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {11716#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} assume ~send4~0 == ~id4~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~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; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~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; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 != ~nomsg~0; {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {11717#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {11718#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:52,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {11718#(not (= ~nomsg~0 ~p4_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {11718#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:52,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {11718#(not (= ~nomsg~0 ~p4_old~0))} assume !(~r1~0 % 256 >= 4); {11718#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:52,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {11718#(not (= ~nomsg~0 ~p4_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {11718#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:52,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {11718#(not (= ~nomsg~0 ~p4_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {11718#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:52,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {11718#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11718#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:52,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {11718#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == ~mode1~0 % 256); {11718#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:52,564 INFO L290 TraceCheckUtils]: 44: Hoare triple {11718#(not (= ~nomsg~0 ~p4_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {11719#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:52,564 INFO L290 TraceCheckUtils]: 45: Hoare triple {11719#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {11713#false} is VALID [2022-02-20 18:52:52,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {11713#false} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {11713#false} is VALID [2022-02-20 18:52:52,565 INFO L290 TraceCheckUtils]: 47: Hoare triple {11713#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11713#false} is VALID [2022-02-20 18:52:52,565 INFO L290 TraceCheckUtils]: 48: Hoare triple {11713#false} assume main_~node2__m2~2#1 != ~nomsg~0; {11713#false} is VALID [2022-02-20 18:52:52,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {11713#false} assume !(main_~node2__m2~2#1 > ~id2~0); {11713#false} is VALID [2022-02-20 18:52:52,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {11713#false} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {11713#false} is VALID [2022-02-20 18:52:52,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {11713#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11713#false} is VALID [2022-02-20 18:52:52,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {11713#false} assume !(main_~node3__m3~2#1 != ~nomsg~0);~mode3~0 := 0; {11713#false} is VALID [2022-02-20 18:52:52,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {11713#false} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {11713#false} is VALID [2022-02-20 18:52:52,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {11713#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11713#false} is VALID [2022-02-20 18:52:52,568 INFO L290 TraceCheckUtils]: 55: Hoare triple {11713#false} assume main_~node4__m4~8#1 != ~nomsg~0; {11713#false} is VALID [2022-02-20 18:52:52,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {11713#false} assume !(main_~node4__m4~8#1 > ~id4~0); {11713#false} is VALID [2022-02-20 18:52:52,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {11713#false} assume main_~node4__m4~8#1 == ~id4~0;~st4~0 := 1;~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~11#1; {11713#false} is VALID [2022-02-20 18:52:52,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {11713#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_1998~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_1998~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; {11713#false} is VALID [2022-02-20 18:52:52,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {11713#false} assume 0 == main_~assert__arg~7#1 % 256; {11713#false} is VALID [2022-02-20 18:52:52,568 INFO L290 TraceCheckUtils]: 60: Hoare triple {11713#false} assume !false; {11713#false} is VALID [2022-02-20 18:52:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:52,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:52,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135088668] [2022-02-20 18:52:52,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135088668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:52,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:52,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:52:52,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987047473] [2022-02-20 18:52:52,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:52,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:52,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:52,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:52,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:52:52,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:52:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:52:52,603 INFO L87 Difference]: Start difference. First operand 245 states and 307 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:54,225 INFO L93 Difference]: Finished difference Result 484 states and 609 transitions. [2022-02-20 18:52:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:52:54,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2022-02-20 18:52:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2022-02-20 18:52:54,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 609 transitions. [2022-02-20 18:52:54,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:54,606 INFO L225 Difference]: With dead ends: 484 [2022-02-20 18:52:54,606 INFO L226 Difference]: Without dead ends: 351 [2022-02-20 18:52:54,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:52:54,607 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 1061 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:54,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 455 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:52:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-20 18:52:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 245. [2022-02-20 18:52:55,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:55,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 245 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 244 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:52:55,030 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 245 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 244 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:52:55,030 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 245 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 244 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:52:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:55,035 INFO L93 Difference]: Finished difference Result 351 states and 433 transitions. [2022-02-20 18:52:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 433 transitions. [2022-02-20 18:52:55,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:55,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:55,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 244 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 351 states. [2022-02-20 18:52:55,036 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 244 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 351 states. [2022-02-20 18:52:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:55,041 INFO L93 Difference]: Finished difference Result 351 states and 433 transitions. [2022-02-20 18:52:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 433 transitions. [2022-02-20 18:52:55,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:55,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:55,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:55,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 244 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:52:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 306 transitions. [2022-02-20 18:52:55,046 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 306 transitions. Word has length 61 [2022-02-20 18:52:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:55,046 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 306 transitions. [2022-02-20 18:52:55,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 306 transitions. [2022-02-20 18:52:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:55,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:55,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:55,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:55,047 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:55,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash -471732578, now seen corresponding path program 1 times [2022-02-20 18:52:55,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:55,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108612469] [2022-02-20 18:52:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:55,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:55,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {13344#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {13346#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:55,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {13346#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {13347#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {13348#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {13348#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {13348#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {13348#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {13349#(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; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {13349#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:55,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {13349#(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; {13350#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:55,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {13350#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13350#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:55,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {13350#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {13350#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:55,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {13350#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {13350#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:55,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {13350#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13350#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:55,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {13350#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {13350#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:55,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {13350#(not (= ~nomsg~0 ~p2_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 4); {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {13351#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:55,183 INFO L290 TraceCheckUtils]: 53: Hoare triple {13351#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13352#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} is VALID [2022-02-20 18:52:55,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {13352#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} assume !(main_~node3__m3~2#1 != ~nomsg~0);~mode3~0 := 0; {13345#false} is VALID [2022-02-20 18:52:55,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {13345#false} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {13345#false} is VALID [2022-02-20 18:52:55,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {13345#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13345#false} is VALID [2022-02-20 18:52:55,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {13345#false} assume main_~node4__m4~8#1 != ~nomsg~0; {13345#false} is VALID [2022-02-20 18:52:55,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {13345#false} assume !(main_~node4__m4~8#1 > ~id4~0); {13345#false} is VALID [2022-02-20 18:52:55,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {13345#false} assume main_~node4__m4~8#1 == ~id4~0;~st4~0 := 1;~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~11#1; {13345#false} is VALID [2022-02-20 18:52:55,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {13345#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_1998~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_1998~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; {13345#false} is VALID [2022-02-20 18:52:55,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {13345#false} assume 0 == main_~assert__arg~7#1 % 256; {13345#false} is VALID [2022-02-20 18:52:55,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {13345#false} assume !false; {13345#false} is VALID [2022-02-20 18:52:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:55,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:55,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108612469] [2022-02-20 18:52:55,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108612469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:55,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:55,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:55,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210964307] [2022-02-20 18:52:55,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:55,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:55,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:55,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:55,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:55,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:55,228 INFO L87 Difference]: Start difference. First operand 245 states and 306 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:58,494 INFO L93 Difference]: Finished difference Result 504 states and 659 transitions. [2022-02-20 18:52:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:58,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 659 transitions. [2022-02-20 18:52:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 659 transitions. [2022-02-20 18:52:58,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 659 transitions. [2022-02-20 18:52:58,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 659 edges. 659 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:58,993 INFO L225 Difference]: With dead ends: 504 [2022-02-20 18:52:58,994 INFO L226 Difference]: Without dead ends: 487 [2022-02-20 18:52:58,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:58,994 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 1776 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:58,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1776 Valid, 1043 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-02-20 18:52:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 245. [2022-02-20 18:52:59,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:59,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 487 states. Second operand has 245 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 244 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:59,492 INFO L74 IsIncluded]: Start isIncluded. First operand 487 states. Second operand has 245 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 244 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:59,493 INFO L87 Difference]: Start difference. First operand 487 states. Second operand has 245 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 244 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:59,501 INFO L93 Difference]: Finished difference Result 487 states and 640 transitions. [2022-02-20 18:52:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 640 transitions. [2022-02-20 18:52:59,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:59,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:59,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 244 states have internal predecessors, (305), 0 states have call successors, (0), 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 487 states. [2022-02-20 18:52:59,503 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 244 states have internal predecessors, (305), 0 states have call successors, (0), 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 487 states. [2022-02-20 18:52:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:59,512 INFO L93 Difference]: Finished difference Result 487 states and 640 transitions. [2022-02-20 18:52:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 640 transitions. [2022-02-20 18:52:59,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:59,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:59,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:59,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 244 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 305 transitions. [2022-02-20 18:52:59,516 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 305 transitions. Word has length 63 [2022-02-20 18:52:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:59,517 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 305 transitions. [2022-02-20 18:52:59,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 305 transitions. [2022-02-20 18:52:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:59,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:59,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:59,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:59,518 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash -157878139, now seen corresponding path program 1 times [2022-02-20 18:52:59,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:59,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062398114] [2022-02-20 18:52:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:59,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {15297#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {15299#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:59,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {15299#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {15300#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {15301#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {15301#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {15301#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:59,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {15301#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:59,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {15302#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {15303#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {15303#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {15303#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {15303#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {15303#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {15303#(not (= ~p3_new~0 ~nomsg~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} ~mode1~0 := 0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,622 INFO L290 TraceCheckUtils]: 52: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~2#1 != ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~2#1 > ~id3~0); {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,623 INFO L290 TraceCheckUtils]: 56: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~2#1;main_~node4__m4~2#1 := ~nomsg~0; {15304#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:59,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {15304#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~2#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15305#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~2#1|))} is VALID [2022-02-20 18:52:59,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {15305#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~2#1|))} assume !(main_~node4__m4~2#1 != ~nomsg~0);~mode4~0 := 0; {15298#false} is VALID [2022-02-20 18:52:59,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {15298#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {15298#false} is VALID [2022-02-20 18:52:59,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {15298#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_2224~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_2224~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; {15298#false} is VALID [2022-02-20 18:52:59,624 INFO L290 TraceCheckUtils]: 61: Hoare triple {15298#false} assume 0 == main_~assert__arg~4#1 % 256; {15298#false} is VALID [2022-02-20 18:52:59,624 INFO L290 TraceCheckUtils]: 62: Hoare triple {15298#false} assume !false; {15298#false} is VALID [2022-02-20 18:52:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:59,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:59,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062398114] [2022-02-20 18:52:59,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062398114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:59,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:59,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:59,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802932948] [2022-02-20 18:52:59,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:59,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:59,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:59,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:59,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:59,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:59,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:59,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:59,663 INFO L87 Difference]: Start difference. First operand 245 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:02,483 INFO L93 Difference]: Finished difference Result 484 states and 627 transitions. [2022-02-20 18:53:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:53:02,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 627 transitions. [2022-02-20 18:53:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 627 transitions. [2022-02-20 18:53:02,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 627 transitions. [2022-02-20 18:53:02,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:02,885 INFO L225 Difference]: With dead ends: 484 [2022-02-20 18:53:02,885 INFO L226 Difference]: Without dead ends: 479 [2022-02-20 18:53:02,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:53:02,886 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 1751 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:02,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1751 Valid, 976 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:53:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-02-20 18:53:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 245. [2022-02-20 18:53:03,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:03,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 244 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,382 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 244 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,382 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 244 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:03,391 INFO L93 Difference]: Finished difference Result 479 states and 622 transitions. [2022-02-20 18:53:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 622 transitions. [2022-02-20 18:53:03,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:03,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:03,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 244 states have internal predecessors, (304), 0 states have call successors, (0), 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 479 states. [2022-02-20 18:53:03,392 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 244 states have internal predecessors, (304), 0 states have call successors, (0), 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 479 states. [2022-02-20 18:53:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:03,400 INFO L93 Difference]: Finished difference Result 479 states and 622 transitions. [2022-02-20 18:53:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 622 transitions. [2022-02-20 18:53:03,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:03,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:03,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:03,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 244 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 304 transitions. [2022-02-20 18:53:03,404 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 304 transitions. Word has length 63 [2022-02-20 18:53:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:03,405 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 304 transitions. [2022-02-20 18:53:03,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 304 transitions. [2022-02-20 18:53:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:53:03,405 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:03,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:03,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:53:03,406 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:53:03,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2011079223, now seen corresponding path program 1 times [2022-02-20 18:53:03,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:03,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274814937] [2022-02-20 18:53:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:03,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {17210#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {17212#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:03,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {17212#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {17213#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:03,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {17213#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {17213#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:03,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {17213#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {17214#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:03,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {17214#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {17214#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:03,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {17214#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:53:03,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {17215#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {17216#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:53:03,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {17216#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {17216#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:53:03,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {17216#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {17216#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:53:03,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {17216#(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; {17216#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:53:03,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {17216#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17216#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:53:03,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {17216#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {17216#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:53:03,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {17216#(not (= ~nomsg~0 ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {17216#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:53:03,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {17216#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {17216#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:53:03,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {17216#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {17216#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:53:03,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {17216#(not (= ~nomsg~0 ~p1_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 4); {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {17217#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:53:03,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {17217#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17218#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} is VALID [2022-02-20 18:53:03,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {17218#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} assume !(main_~node2__m2~2#1 != ~nomsg~0);~mode2~0 := 0; {17211#false} is VALID [2022-02-20 18:53:03,516 INFO L290 TraceCheckUtils]: 51: Hoare triple {17211#false} havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {17211#false} is VALID [2022-02-20 18:53:03,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {17211#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17211#false} is VALID [2022-02-20 18:53:03,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {17211#false} assume main_~node3__m3~12#1 != ~nomsg~0; {17211#false} is VALID [2022-02-20 18:53:03,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {17211#false} assume !(main_~node3__m3~12#1 > ~id3~0); {17211#false} is VALID [2022-02-20 18:53:03,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {17211#false} assume main_~node3__m3~12#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~14#1;main_~node4__m4~14#1 := ~nomsg~0; {17211#false} is VALID [2022-02-20 18:53:03,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {17211#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~14#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {17211#false} is VALID [2022-02-20 18:53:03,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {17211#false} assume main_~node4__m4~14#1 != ~nomsg~0; {17211#false} is VALID [2022-02-20 18:53:03,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {17211#false} assume !(main_~node4__m4~14#1 > ~id4~0); {17211#false} is VALID [2022-02-20 18:53:03,517 INFO L290 TraceCheckUtils]: 59: Hoare triple {17211#false} assume main_~node4__m4~14#1 == ~id4~0;~st4~0 := 1;~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~19#1; {17211#false} is VALID [2022-02-20 18:53:03,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {17211#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~19#1 := 0;~__return_1561~0 := main_~check__tmp~19#1;main_~main__c1~0#1 := ~__return_1561~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; {17211#false} is VALID [2022-02-20 18:53:03,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {17211#false} assume 0 == main_~assert__arg~15#1 % 256; {17211#false} is VALID [2022-02-20 18:53:03,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {17211#false} assume !false; {17211#false} is VALID [2022-02-20 18:53:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:03,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:03,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274814937] [2022-02-20 18:53:03,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274814937] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:03,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:03,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:53:03,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277306453] [2022-02-20 18:53:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:03,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:03,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:03,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:53:03,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:03,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:53:03,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:53:03,582 INFO L87 Difference]: Start difference. First operand 245 states and 304 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:06,645 INFO L93 Difference]: Finished difference Result 585 states and 769 transitions. [2022-02-20 18:53:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:53:06,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 769 transitions. [2022-02-20 18:53:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 769 transitions. [2022-02-20 18:53:06,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 769 transitions. [2022-02-20 18:53:07,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 769 edges. 769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:07,119 INFO L225 Difference]: With dead ends: 585 [2022-02-20 18:53:07,119 INFO L226 Difference]: Without dead ends: 491 [2022-02-20 18:53:07,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:53:07,120 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 1853 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:07,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1853 Valid, 1168 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:53:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-02-20 18:53:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 245. [2022-02-20 18:53:07,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:07,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand has 245 states, 234 states have (on average 1.294871794871795) internal successors, (303), 244 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,616 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand has 245 states, 234 states have (on average 1.294871794871795) internal successors, (303), 244 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,617 INFO L87 Difference]: Start difference. First operand 491 states. Second operand has 245 states, 234 states have (on average 1.294871794871795) internal successors, (303), 244 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:07,625 INFO L93 Difference]: Finished difference Result 491 states and 640 transitions. [2022-02-20 18:53:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 640 transitions. [2022-02-20 18:53:07,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:07,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:07,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.294871794871795) internal successors, (303), 244 states have internal predecessors, (303), 0 states have call successors, (0), 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 491 states. [2022-02-20 18:53:07,626 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.294871794871795) internal successors, (303), 244 states have internal predecessors, (303), 0 states have call successors, (0), 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 491 states. [2022-02-20 18:53:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:07,635 INFO L93 Difference]: Finished difference Result 491 states and 640 transitions. [2022-02-20 18:53:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 640 transitions. [2022-02-20 18:53:07,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:07,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:07,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:07,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.294871794871795) internal successors, (303), 244 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 303 transitions. [2022-02-20 18:53:07,639 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 303 transitions. Word has length 63 [2022-02-20 18:53:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:07,640 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 303 transitions. [2022-02-20 18:53:07,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 303 transitions. [2022-02-20 18:53:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:53:07,641 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:07,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:07,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:53:07,641 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:53:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash 556986468, now seen corresponding path program 1 times [2022-02-20 18:53:07,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:07,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362830042] [2022-02-20 18:53:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:07,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {19276#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {19278#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:07,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {19278#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:07,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:07,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:07,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:07,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:07,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:07,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {19279#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {19280#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:07,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {19280#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {19280#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:53:07,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {19280#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {19281#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:53:07,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {19281#(and (<= 0 ~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; {19282#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:07,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {19282#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19282#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:07,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {19282#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {19282#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:07,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {19282#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {19282#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:07,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {19282#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {19282#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:07,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {19282#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {19282#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:07,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {19282#(not (= ~nomsg~0 ~p2_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 4); {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,741 INFO L290 TraceCheckUtils]: 51: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {19283#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:07,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {19283#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19284#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~11#1|))} is VALID [2022-02-20 18:53:07,742 INFO L290 TraceCheckUtils]: 54: Hoare triple {19284#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~11#1|))} assume !(main_~node3__m3~11#1 != ~nomsg~0);~mode3~0 := 0; {19277#false} is VALID [2022-02-20 18:53:07,742 INFO L290 TraceCheckUtils]: 55: Hoare triple {19277#false} havoc main_~node4__m4~19#1;main_~node4__m4~19#1 := ~nomsg~0; {19277#false} is VALID [2022-02-20 18:53:07,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {19277#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~19#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19277#false} is VALID [2022-02-20 18:53:07,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {19277#false} assume main_~node4__m4~19#1 != ~nomsg~0; {19277#false} is VALID [2022-02-20 18:53:07,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {19277#false} assume !(main_~node4__m4~19#1 > ~id4~0); {19277#false} is VALID [2022-02-20 18:53:07,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {19277#false} assume main_~node4__m4~19#1 == ~id4~0;~st4~0 := 1;~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~25#1; {19277#false} is VALID [2022-02-20 18:53:07,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {19277#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~25#1 := 0;~__return_1248~0 := main_~check__tmp~25#1;main_~main__c1~0#1 := ~__return_1248~0;havoc main_~__tmp_22~0#1;main_~__tmp_22~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~21#1;main_~assert__arg~21#1 := main_~__tmp_22~0#1; {19277#false} is VALID [2022-02-20 18:53:07,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {19277#false} assume 0 == main_~assert__arg~21#1 % 256; {19277#false} is VALID [2022-02-20 18:53:07,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {19277#false} assume !false; {19277#false} is VALID [2022-02-20 18:53:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:07,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:07,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362830042] [2022-02-20 18:53:07,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362830042] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:07,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:07,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:53:07,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456203314] [2022-02-20 18:53:07,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:07,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:07,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:07,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:07,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:53:07,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:07,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:53:07,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:53:07,783 INFO L87 Difference]: Start difference. First operand 245 states and 303 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:10,986 INFO L93 Difference]: Finished difference Result 558 states and 737 transitions. [2022-02-20 18:53:10,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:53:10,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 737 transitions. [2022-02-20 18:53:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 737 transitions. [2022-02-20 18:53:10,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 737 transitions. [2022-02-20 18:53:11,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 737 edges. 737 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:11,438 INFO L225 Difference]: With dead ends: 558 [2022-02-20 18:53:11,438 INFO L226 Difference]: Without dead ends: 487 [2022-02-20 18:53:11,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:53:11,438 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 1789 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:11,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1789 Valid, 1219 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:53:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-02-20 18:53:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 245. [2022-02-20 18:53:11,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:11,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 487 states. Second operand has 245 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 244 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:11,985 INFO L74 IsIncluded]: Start isIncluded. First operand 487 states. Second operand has 245 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 244 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:11,986 INFO L87 Difference]: Start difference. First operand 487 states. Second operand has 245 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 244 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:11,994 INFO L93 Difference]: Finished difference Result 487 states and 636 transitions. [2022-02-20 18:53:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 636 transitions. [2022-02-20 18:53:11,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:11,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:11,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 244 states have internal predecessors, (302), 0 states have call successors, (0), 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 487 states. [2022-02-20 18:53:11,996 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 244 states have internal predecessors, (302), 0 states have call successors, (0), 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 487 states. [2022-02-20 18:53:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:12,005 INFO L93 Difference]: Finished difference Result 487 states and 636 transitions. [2022-02-20 18:53:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 636 transitions. [2022-02-20 18:53:12,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:12,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:12,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:12,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:12,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 244 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 302 transitions. [2022-02-20 18:53:12,009 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 302 transitions. Word has length 63 [2022-02-20 18:53:12,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:12,009 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 302 transitions. [2022-02-20 18:53:12,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 302 transitions. [2022-02-20 18:53:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:53:12,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:12,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:12,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:53:12,011 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:53:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:12,011 INFO L85 PathProgramCache]: Analyzing trace with hash -33472501, now seen corresponding path program 1 times [2022-02-20 18:53:12,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:12,011 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329268831] [2022-02-20 18:53:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:12,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:12,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {21303#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {21305#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:12,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {21305#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {21306#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {21307#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {21307#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {21307#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:12,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {21307#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:12,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {21308#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {21309#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {21309#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {21309#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {21309#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {21309#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {21309#(not (= ~p3_new~0 ~nomsg~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} ~mode2~0 := 0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node3__m3~11#1;main_~node3__m3~11#1 := ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~11#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~11#1 != ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~11#1 > ~id3~0); {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~11#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~13#1;main_~node4__m4~13#1 := ~nomsg~0; {21310#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:12,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {21310#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~13#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21311#(not (= |ULTIMATE.start_main_~node4__m4~13#1| ~nomsg~0))} is VALID [2022-02-20 18:53:12,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {21311#(not (= |ULTIMATE.start_main_~node4__m4~13#1| ~nomsg~0))} assume !(main_~node4__m4~13#1 != ~nomsg~0);~mode4~0 := 0; {21304#false} is VALID [2022-02-20 18:53:12,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {21304#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~21#1; {21304#false} is VALID [2022-02-20 18:53:12,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {21304#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~21#1 := 0;~__return_1451~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_1451~0;havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~17#1;main_~assert__arg~17#1 := main_~__tmp_18~0#1; {21304#false} is VALID [2022-02-20 18:53:12,131 INFO L290 TraceCheckUtils]: 61: Hoare triple {21304#false} assume 0 == main_~assert__arg~17#1 % 256; {21304#false} is VALID [2022-02-20 18:53:12,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {21304#false} assume !false; {21304#false} is VALID [2022-02-20 18:53:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:12,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:12,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329268831] [2022-02-20 18:53:12,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329268831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:12,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:12,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:53:12,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658535440] [2022-02-20 18:53:12,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:12,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:12,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:12,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:12,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:12,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:53:12,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:12,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:53:12,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:53:12,170 INFO L87 Difference]: Start difference. First operand 245 states and 302 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:15,165 INFO L93 Difference]: Finished difference Result 538 states and 705 transitions. [2022-02-20 18:53:15,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:53:15,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 705 transitions. [2022-02-20 18:53:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 705 transitions. [2022-02-20 18:53:15,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 705 transitions. [2022-02-20 18:53:15,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 705 edges. 705 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:15,596 INFO L225 Difference]: With dead ends: 538 [2022-02-20 18:53:15,596 INFO L226 Difference]: Without dead ends: 479 [2022-02-20 18:53:15,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:53:15,597 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 1297 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:15,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1297 Valid, 1027 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:53:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-02-20 18:53:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 245. [2022-02-20 18:53:16,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:16,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 244 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,178 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 244 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,178 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 244 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:16,186 INFO L93 Difference]: Finished difference Result 479 states and 619 transitions. [2022-02-20 18:53:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 619 transitions. [2022-02-20 18:53:16,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:16,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:16,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 244 states have internal predecessors, (301), 0 states have call successors, (0), 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 479 states. [2022-02-20 18:53:16,189 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 244 states have internal predecessors, (301), 0 states have call successors, (0), 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 479 states. [2022-02-20 18:53:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:16,203 INFO L93 Difference]: Finished difference Result 479 states and 619 transitions. [2022-02-20 18:53:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 619 transitions. [2022-02-20 18:53:16,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:16,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:16,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:16,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 244 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 301 transitions. [2022-02-20 18:53:16,208 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 301 transitions. Word has length 63 [2022-02-20 18:53:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:16,208 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 301 transitions. [2022-02-20 18:53:16,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 301 transitions. [2022-02-20 18:53:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:53:16,209 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:16,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:16,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:53:16,209 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:53:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash 543767036, now seen corresponding path program 1 times [2022-02-20 18:53:16,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:16,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392847503] [2022-02-20 18:53:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:16,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {23292#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {23294#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:16,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {23294#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {23295#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {23296#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {23296#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {23296#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:16,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {23296#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:16,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {23297#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {23298#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {23298#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {23298#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {23298#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {23298#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {23298#(not (= ~p3_new~0 ~nomsg~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,331 INFO L290 TraceCheckUtils]: 51: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~1#1 > ~id3~0); {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,332 INFO L290 TraceCheckUtils]: 55: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {23299#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:16,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {23299#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23300#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~1#1|))} is VALID [2022-02-20 18:53:16,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {23300#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~1#1|))} assume !(main_~node4__m4~1#1 != ~nomsg~0);~mode4~0 := 0; {23293#false} is VALID [2022-02-20 18:53:16,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {23293#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {23293#false} is VALID [2022-02-20 18:53:16,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {23293#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2348~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2348~0; {23293#false} is VALID [2022-02-20 18:53:16,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {23293#false} havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~13#1;main_~assert__arg~13#1 := main_~__tmp_14~0#1; {23293#false} is VALID [2022-02-20 18:53:16,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {23293#false} assume 0 == main_~assert__arg~13#1 % 256; {23293#false} is VALID [2022-02-20 18:53:16,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {23293#false} assume !false; {23293#false} is VALID [2022-02-20 18:53:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:16,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:16,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392847503] [2022-02-20 18:53:16,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392847503] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:16,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:16,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:53:16,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011784575] [2022-02-20 18:53:16,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:16,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:16,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:16,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:53:16,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:53:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:53:16,382 INFO L87 Difference]: Start difference. First operand 245 states and 301 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:19,280 INFO L93 Difference]: Finished difference Result 535 states and 701 transitions. [2022-02-20 18:53:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:53:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 701 transitions. [2022-02-20 18:53:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 701 transitions. [2022-02-20 18:53:19,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 701 transitions. [2022-02-20 18:53:19,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:19,711 INFO L225 Difference]: With dead ends: 535 [2022-02-20 18:53:19,711 INFO L226 Difference]: Without dead ends: 479 [2022-02-20 18:53:19,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:53:19,712 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 932 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:19,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [932 Valid, 995 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:53:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-02-20 18:53:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 245. [2022-02-20 18:53:20,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:20,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 244 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,266 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 244 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,266 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 245 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 244 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:20,275 INFO L93 Difference]: Finished difference Result 479 states and 618 transitions. [2022-02-20 18:53:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 618 transitions. [2022-02-20 18:53:20,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:20,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:20,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 244 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 479 states. [2022-02-20 18:53:20,276 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 244 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 479 states. [2022-02-20 18:53:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:20,284 INFO L93 Difference]: Finished difference Result 479 states and 618 transitions. [2022-02-20 18:53:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 618 transitions. [2022-02-20 18:53:20,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:20,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:20,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:20,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 244 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 300 transitions. [2022-02-20 18:53:20,288 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 300 transitions. Word has length 63 [2022-02-20 18:53:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:20,288 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 300 transitions. [2022-02-20 18:53:20,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 300 transitions. [2022-02-20 18:53:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:53:20,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:20,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:20,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:53:20,289 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:53:20,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash -130251118, now seen corresponding path program 1 times [2022-02-20 18:53:20,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:20,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947814804] [2022-02-20 18:53:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:20,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:20,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {25278#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {25280#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:53:20,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {25280#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {25281#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {25282#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {25282#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {25282#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {25282#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {25283#(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; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {25283#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:20,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {25283#(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; {25284#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:20,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {25284#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {25284#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:20,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {25284#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {25284#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:20,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {25284#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {25284#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:20,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {25284#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {25284#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:20,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {25284#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {25284#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:20,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {25284#(not (= ~nomsg~0 ~p2_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 4); {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {25285#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {25285#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25286#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {25286#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0);~mode3~0 := 0; {25279#false} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {25279#false} havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {25279#false} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {25279#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25279#false} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {25279#false} assume main_~node4__m4~7#1 != ~nomsg~0; {25279#false} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {25279#false} assume main_~node4__m4~7#1 > ~id4~0;~send4~0 := main_~node4__m4~7#1; {25279#false} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {25279#false} ~mode4~0 := 0; {25279#false} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {25279#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~13#1; {25279#false} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {25279#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~13#1 := 0;~__return_1891~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_1891~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; {25279#false} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {25279#false} assume 0 == main_~assert__arg~9#1 % 256; {25279#false} is VALID [2022-02-20 18:53:20,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {25279#false} assume !false; {25279#false} is VALID [2022-02-20 18:53:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:20,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:20,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947814804] [2022-02-20 18:53:20,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947814804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:20,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:20,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:53:20,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172305806] [2022-02-20 18:53:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:20,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:20,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:20,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:20,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:53:20,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:20,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:53:20,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:53:20,455 INFO L87 Difference]: Start difference. First operand 245 states and 300 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:23,800 INFO L93 Difference]: Finished difference Result 553 states and 726 transitions. [2022-02-20 18:53:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:53:23,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 726 transitions. [2022-02-20 18:53:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 726 transitions. [2022-02-20 18:53:23,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 726 transitions. [2022-02-20 18:53:24,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:24,300 INFO L225 Difference]: With dead ends: 553 [2022-02-20 18:53:24,300 INFO L226 Difference]: Without dead ends: 487 [2022-02-20 18:53:24,301 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:53:24,301 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 1652 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:24,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1652 Valid, 1138 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:53:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-02-20 18:53:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 245. [2022-02-20 18:53:24,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:24,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 487 states. Second operand has 245 states, 234 states have (on average 1.2777777777777777) internal successors, (299), 244 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,869 INFO L74 IsIncluded]: Start isIncluded. First operand 487 states. Second operand has 245 states, 234 states have (on average 1.2777777777777777) internal successors, (299), 244 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,869 INFO L87 Difference]: Start difference. First operand 487 states. Second operand has 245 states, 234 states have (on average 1.2777777777777777) internal successors, (299), 244 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:24,877 INFO L93 Difference]: Finished difference Result 487 states and 632 transitions. [2022-02-20 18:53:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 632 transitions. [2022-02-20 18:53:24,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:24,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:24,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 234 states have (on average 1.2777777777777777) internal successors, (299), 244 states have internal predecessors, (299), 0 states have call successors, (0), 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 487 states. [2022-02-20 18:53:24,878 INFO L87 Difference]: Start difference. First operand has 245 states, 234 states have (on average 1.2777777777777777) internal successors, (299), 244 states have internal predecessors, (299), 0 states have call successors, (0), 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 487 states. [2022-02-20 18:53:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:24,886 INFO L93 Difference]: Finished difference Result 487 states and 632 transitions. [2022-02-20 18:53:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 632 transitions. [2022-02-20 18:53:24,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:24,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:24,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:24,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2777777777777777) internal successors, (299), 244 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 299 transitions. [2022-02-20 18:53:24,891 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 299 transitions. Word has length 63 [2022-02-20 18:53:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:24,891 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 299 transitions. [2022-02-20 18:53:24,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 299 transitions. [2022-02-20 18:53:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:53:24,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:24,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:24,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:53:24,892 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:53:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2022048839, now seen corresponding path program 1 times [2022-02-20 18:53:24,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:24,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262904790] [2022-02-20 18:53:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:25,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {27302#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_121~0 := 0;~__return_801~0 := 0;~__return_2624~0 := 0;~__return_787~0 := 0;~__return_2467~0 := 0;~__return_773~0 := 0;~__return_2348~0 := 0;~__return_759~0 := 0;~__return_2224~0 := 0;~__return_745~0 := 0;~__return_2122~0 := 0;~__return_731~0 := 0;~__return_1998~0 := 0;~__return_717~0 := 0;~__return_1891~0 := 0;~__return_703~0 := 0;~__return_1784~0 := 0;~__return_689~0 := 0;~__return_1688~0 := 0;~__return_675~0 := 0;~__return_1561~0 := 0;~__return_661~0 := 0;~__return_1451~0 := 0;~__return_647~0 := 0;~__return_1344~0 := 0;~__return_633~0 := 0;~__return_1248~0 := 0;~__return_619~0 := 0;~__return_1141~0 := 0;~__return_605~0 := 0;~__return_1048~0 := 0;~__return_591~0 := 0;~__return_955~0 := 0; {27302#true} is VALID [2022-02-20 18:53:25,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {27302#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~check__tmp~3#1, main_~node4__m4~2#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~check__tmp~5#1, main_~node4__m4~4#1, main_~node3__m3~3#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~7#1, main_~node4__m4~5#1, main_~node3__m3~4#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~6#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~3#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~check__tmp~9#1, main_~node4__m4~7#1, main_~node3__m3~6#1, main_~node2__m2~5#1, main_~node1__m1~5#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~8#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~11#1, main_~node4__m4~8#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~6#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~10#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~6#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~13#1, main_~node4__m4~10#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~12#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~15#1, main_~node4__m4~11#1, main_~node3__m3~9#1, main_~node2__m2~8#1, main_~node1__m1~8#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~14#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~9#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~5#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4__m4~13#1, main_~node3__m3~11#1, main_~node2__m2~10#1, main_~node1__m1~9#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~16#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4__m4~14#1, main_~node3__m3~12#1, main_~node2__m2~11#1, main_~node1__m1~10#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4__m4~16#1, main_~node3__m3~13#1, main_~node2__m2~12#1, main_~node1__m1~11#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4__m4~17#1, main_~node3__m3~14#1, main_~node2__m2~13#1, main_~node1__m1~12#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~15#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~10#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4__m4~19#1, main_~node3__m3~16#1, main_~node2__m2~14#1, main_~node1__m1~13#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4__m4~20#1, main_~node3__m3~17#1, main_~node2__m2~15#1, main_~node1__m1~14#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~18#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4__m4~22#1, main_~node3__m3~18#1, main_~node2__m2~16#1, main_~node1__m1~15#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~24#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~20#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~18#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4__m4~23#1, main_~node3__m3~19#1, main_~node2__m2~17#1, main_~node1__m1~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~21#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~9#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {27304#(<= ~id2~0 127)} is VALID [2022-02-20 18:53:25,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {27304#(<= ~id2~0 127)} assume 0 == ~r1~0 % 256; {27304#(<= ~id2~0 127)} is VALID [2022-02-20 18:53:25,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {27304#(<= ~id2~0 127)} assume ~id1~0 >= 0; {27305#(<= ~id2~0 (+ ~id1~0 127))} is VALID [2022-02-20 18:53:25,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {27305#(<= ~id2~0 (+ ~id1~0 127))} assume 0 == ~st1~0; {27305#(<= ~id2~0 (+ ~id1~0 127))} is VALID [2022-02-20 18:53:25,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {27305#(<= ~id2~0 (+ ~id1~0 127))} assume ~send1~0 == ~id1~0; {27306#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:53:25,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {27306#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} assume 0 == ~mode1~0 % 256; {27306#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:53:25,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {27306#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} assume ~id2~0 >= 0; {27307#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:53:25,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {27307#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume 0 == ~st2~0; {27307#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:53:25,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {27307#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {27308#(and (<= ~send2~0 ~id2~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:53:25,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {27308#(and (<= ~send2~0 ~id2~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)))} assume 0 == ~mode2~0 % 256; {27308#(and (<= ~send2~0 ~id2~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:53:25,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {27308#(and (<= ~send2~0 ~id2~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)))} assume ~id3~0 >= 0; {27309#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:53:25,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {27309#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)))} assume 0 == ~st3~0; {27309#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:53:25,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {27309#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)))} assume ~send3~0 == ~id3~0; {27310#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {27310#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {27310#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {27310#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {27311#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id4~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {27311#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id4~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume 0 == ~st4~0; {27311#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id4~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {27311#(and (<= 0 ~id3~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id4~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_121~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_121~0; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~0 ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:25,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {27312#(and (<= 0 ~id3~0) (<= (+ ~send4~0 ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~send2~0 (+ ~id3~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; {27313#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~send4~0) (<= (+ ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~send2~0 (* 256 (div (+ 255 (* (- 1) ~send3~0) (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) 256)) ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:53:25,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {27313#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~send4~0) (<= (+ ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~send2~0 (* 256 (div (+ 255 (* (- 1) ~send3~0) (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) 256)) ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {27313#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~send4~0) (<= (+ ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~send2~0 (* 256 (div (+ 255 (* (- 1) ~send3~0) (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) 256)) ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:53:25,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {27313#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~send4~0) (<= (+ ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~send2~0 (* 256 (div (+ 255 (* (- 1) ~send3~0) (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) 256)) ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))))} assume ~send2~0 != ~nomsg~0; {27313#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~send4~0) (<= (+ ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~send2~0 (* 256 (div (+ 255 (* (- 1) ~send3~0) (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) 256)) ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:53:25,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {27313#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~send4~0) (<= (+ ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~send3~0 ~send2~0 (* 256 (div (+ 255 (* (- 1) ~send3~0) (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) 256)) ~p1_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))) (<= (+ ~send2~0 ~p1_new~0 1) (+ ~id3~0 ~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; {27314#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 (* (div (+ 255 (* (- 1) ~send3~0)) 256) 256) ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:53:25,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {27314#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 (* (div (+ 255 (* (- 1) ~send3~0)) 256) 256) ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {27314#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 (* (div (+ 255 (* (- 1) ~send3~0)) 256) 256) ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:53:25,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {27314#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 (* (div (+ 255 (* (- 1) ~send3~0)) 256) 256) ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))))} assume ~send3~0 != ~nomsg~0; {27314#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 (* (div (+ 255 (* (- 1) ~send3~0)) 256) 256) ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:53:25,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {27314#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0) (<= (+ ~send4~0 ~send3~0 ~p1_new~0 (* (div (+ 255 (* (- 1) ~send3~0)) 256) 256) ~p2_new~0) (+ ~id1~0 ~id4~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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {27315#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0)))} is VALID [2022-02-20 18:53:25,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {27315#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {27315#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0)))} is VALID [2022-02-20 18:53:25,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {27315#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0)))} assume ~send4~0 != ~nomsg~0; {27315#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0)))} is VALID [2022-02-20 18:53:25,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {27315#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 ~p2_new~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) ~p1_new~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send4~0 ~p3_new~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= 0 ~send4~0)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(~r1~0 % 256 >= 4); {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_801~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_801~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; {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode1~0 % 256); {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {27316#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 ~p4_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p4_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {27317#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:53:25,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {27317#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {27317#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:53:25,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {27317#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0 1) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id4~0 ~id3~0 ~id2~0)))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {27318#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {27318#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0; {27318#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {27318#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {27318#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {27318#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {27319#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,614 INFO L290 TraceCheckUtils]: 50: Hoare triple {27319#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {27319#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {27319#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {27320#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:53:25,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {27320#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id4~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {27321#(or (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0)))} is VALID [2022-02-20 18:53:25,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {27321#(or (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id4~0 ~id3~0)))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {27322#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node3__m3~2#1| 1) (+ ~id4~0 ~id3~0)) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:53:25,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {27322#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node3__m3~2#1| 1) (+ ~id4~0 ~id3~0)) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume main_~node3__m3~2#1 != ~nomsg~0; {27322#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node3__m3~2#1| 1) (+ ~id4~0 ~id3~0)) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:53:25,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {27322#(or (<= (+ ~p3_old~0 |ULTIMATE.start_main_~node3__m3~2#1| 1) (+ ~id4~0 ~id3~0)) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume main_~node3__m3~2#1 > ~id3~0;~send3~0 := main_~node3__m3~2#1; {27323#(<= (+ ~p3_old~0 2) ~id4~0)} is VALID [2022-02-20 18:53:25,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {27323#(<= (+ ~p3_old~0 2) ~id4~0)} ~mode3~0 := 0; {27323#(<= (+ ~p3_old~0 2) ~id4~0)} is VALID [2022-02-20 18:53:25,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {27323#(<= (+ ~p3_old~0 2) ~id4~0)} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {27323#(<= (+ ~p3_old~0 2) ~id4~0)} is VALID [2022-02-20 18:53:25,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {27323#(<= (+ ~p3_old~0 2) ~id4~0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {27324#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} is VALID [2022-02-20 18:53:25,625 INFO L290 TraceCheckUtils]: 59: Hoare triple {27324#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} assume main_~node4__m4~8#1 != ~nomsg~0; {27324#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} is VALID [2022-02-20 18:53:25,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {27324#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} assume !(main_~node4__m4~8#1 > ~id4~0); {27324#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} is VALID [2022-02-20 18:53:25,626 INFO L290 TraceCheckUtils]: 61: Hoare triple {27324#(<= (+ 2 |ULTIMATE.start_main_~node4__m4~8#1|) ~id4~0)} assume main_~node4__m4~8#1 == ~id4~0;~st4~0 := 1;~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~11#1; {27303#false} is VALID [2022-02-20 18:53:25,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {27303#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_1998~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_1998~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; {27303#false} is VALID [2022-02-20 18:53:25,626 INFO L290 TraceCheckUtils]: 63: Hoare triple {27303#false} assume 0 == main_~assert__arg~7#1 % 256; {27303#false} is VALID [2022-02-20 18:53:25,626 INFO L290 TraceCheckUtils]: 64: Hoare triple {27303#false} assume !false; {27303#false} is VALID [2022-02-20 18:53:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:25,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:25,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262904790] [2022-02-20 18:53:25,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262904790] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:25,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:25,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-20 18:53:25,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944747704] [2022-02-20 18:53:25,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:25,628 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:53:25,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:25,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:25,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:25,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 18:53:25,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:25,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 18:53:25,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:53:25,680 INFO L87 Difference]: Start difference. First operand 245 states and 299 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)