./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:51:31,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:51:31,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:51:31,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:51:31,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:51:31,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:51:31,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:51:31,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:51:31,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:51:31,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:51:31,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:51:31,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:51:31,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:51:31,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:51:31,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:51:31,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:51:31,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:51:31,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:51:31,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:51:31,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:51:31,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:51:31,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:51:31,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:51:31,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:51:31,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:51:31,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:51:31,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:51:31,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:51:31,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:51:31,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:51:31,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:51:31,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:51:31,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:51:31,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:51:31,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:51:31,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:51:31,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:51:31,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:51:31,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:51:31,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:51:31,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:51:31,946 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:51:31,962 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:51:31,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:51:31,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:51:31,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:51:31,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:51:31,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:51:31,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:51:31,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:51:31,964 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:51:31,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:51:31,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:51:31,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:51:31,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:51:31,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:51:31,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:51:31,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:51:31,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:51:31,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:51:31,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:51:31,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:51:31,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:51:31,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:51:31,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:51:31,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:51:31,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:31,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:51:31,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:51:31,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:51:31,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:51:31,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:51:31,966 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:51:31,966 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:51:31,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:51:31,967 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 -> c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 [2022-02-20 18:51:32,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:51:32,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:51:32,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:51:32,160 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:51:32,161 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:51:32,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2022-02-20 18:51:32,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94648aef/cd348bc092424f9db523a756dc1d21e9/FLAGbc59aa64d [2022-02-20 18:51:32,620 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:51:32,623 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2022-02-20 18:51:32,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94648aef/cd348bc092424f9db523a756dc1d21e9/FLAGbc59aa64d [2022-02-20 18:51:32,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94648aef/cd348bc092424f9db523a756dc1d21e9 [2022-02-20 18:51:32,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:51:32,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:51:32,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:32,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:51:32,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:51:32,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:32" (1/1) ... [2022-02-20 18:51:32,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5134b529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:32, skipping insertion in model container [2022-02-20 18:51:32,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:32" (1/1) ... [2022-02-20 18:51:32,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:51:32,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:51:32,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2022-02-20 18:51:32,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2022-02-20 18:51:32,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2022-02-20 18:51:32,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2022-02-20 18:51:32,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2022-02-20 18:51:32,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2022-02-20 18:51:32,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2022-02-20 18:51:32,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2022-02-20 18:51:32,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2022-02-20 18:51:32,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2022-02-20 18:51:32,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2022-02-20 18:51:33,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:33,087 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:51:33,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2022-02-20 18:51:33,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2022-02-20 18:51:33,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2022-02-20 18:51:33,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.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2022-02-20 18:51:33,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2022-02-20 18:51:33,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2022-02-20 18:51:33,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2022-02-20 18:51:33,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2022-02-20 18:51:33,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2022-02-20 18:51:33,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2022-02-20 18:51:33,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2022-02-20 18:51:33,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:33,309 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:51:33,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33 WrapperNode [2022-02-20 18:51:33,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:33,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:33,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:51:33,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:51:33,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,402 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1870 [2022-02-20 18:51:33,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:33,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:51:33,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:51:33,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:51:33,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:51:33,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:51:33,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:51:33,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:51:33,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (1/1) ... [2022-02-20 18:51:33,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:33,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:51:33,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:51:33,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:51:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:51:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:51:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:51:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:51:33,693 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:51:33,694 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:51:34,663 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:51:34,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:51:34,679 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:51:34,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:34 BoogieIcfgContainer [2022-02-20 18:51:34,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:51:34,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:51:34,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:51:34,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:51:34,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:51:32" (1/3) ... [2022-02-20 18:51:34,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1018cf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:34, skipping insertion in model container [2022-02-20 18:51:34,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:33" (2/3) ... [2022-02-20 18:51:34,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1018cf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:34, skipping insertion in model container [2022-02-20 18:51:34,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:34" (3/3) ... [2022-02-20 18:51:34,687 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2022-02-20 18:51:34,691 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:51:34,691 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-20 18:51:34,760 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:51:34,765 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:51:34,765 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-20 18:51:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:51:34,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:34,805 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:51:34,805 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:34,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1374718599, now seen corresponding path program 1 times [2022-02-20 18:51:34,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:34,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206401706] [2022-02-20 18:51:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:35,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {361#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {363#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:35,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {363#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:35,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {363#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:35,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {363#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {364#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:35,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {364#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {364#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:35,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {365#(<= (+ ~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; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:35,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {362#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~2#1; {362#false} is VALID [2022-02-20 18:51:35,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {362#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~2#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~2#1 % 256 else main_~node2____CPAchecker_TMP_0~2#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {362#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {362#false} is VALID [2022-02-20 18:51:35,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {362#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~4#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~4#1 % 256 else main_~node3____CPAchecker_TMP_0~4#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~16#1;main_~node4__m4~16#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {362#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~8#1; {362#false} is VALID [2022-02-20 18:51:35,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {362#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~8#1 := ~p4_new~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~8#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~8#1 % 256 else main_~node4____CPAchecker_TMP_0~8#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~31#1; {362#false} is VALID [2022-02-20 18:51:35,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {362#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {362#false} is VALID [2022-02-20 18:51:35,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {362#false} assume !(~r1~0 >= 4); {362#false} is VALID [2022-02-20 18:51:35,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {362#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {362#false} is VALID [2022-02-20 18:51:35,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {362#false} assume ~r1~0 < 4;main_~check__tmp~31#1 := 1;~__return_3028~0 := main_~check__tmp~31#1;main_~main__c1~0#1 := ~__return_3028~0;havoc main_~__tmp_28~0#1;main_~__tmp_28~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~27#1;main_~assert__arg~27#1 := main_~__tmp_28~0#1; {362#false} is VALID [2022-02-20 18:51:35,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {362#false} assume !(0 == main_~assert__arg~27#1 % 256);main_~main____CPAchecker_TMP_0~17#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~17#1; {362#false} is VALID [2022-02-20 18:51:35,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {362#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {362#false} is VALID [2022-02-20 18:51:35,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {362#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {362#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {362#false} assume main_~node1__m1~1#1 != ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {362#false} assume !(main_~node1__m1~1#1 > ~id1~0); {362#false} is VALID [2022-02-20 18:51:35,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {362#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {362#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {362#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {362#false} is VALID [2022-02-20 18:51:35,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {362#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {362#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {362#false} assume main_~node3__m3~4#1 != ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,190 INFO L290 TraceCheckUtils]: 51: Hoare triple {362#false} assume !(main_~node3__m3~4#1 > ~id3~0); {362#false} is VALID [2022-02-20 18:51:35,190 INFO L290 TraceCheckUtils]: 52: Hoare triple {362#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,191 INFO L290 TraceCheckUtils]: 53: Hoare triple {362#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:51:35,191 INFO L290 TraceCheckUtils]: 54: Hoare triple {362#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {362#false} is VALID [2022-02-20 18:51:35,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {362#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~12#1; {362#false} is VALID [2022-02-20 18:51:35,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {362#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3746~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3746~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; {362#false} is VALID [2022-02-20 18:51:35,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {362#false} assume 0 == main_~assert__arg~11#1 % 256; {362#false} is VALID [2022-02-20 18:51:35,193 INFO L290 TraceCheckUtils]: 58: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-02-20 18:51:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:35,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:35,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206401706] [2022-02-20 18:51:35,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206401706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:35,199 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:35,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:35,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512454779] [2022-02-20 18:51:35,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:35,207 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:51:35,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:35,215 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:51:35,260 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:51:35,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:35,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:35,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:35,282 INFO L87 Difference]: Start difference. First operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 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:51:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:36,401 INFO L93 Difference]: Finished difference Result 704 states and 1191 transitions. [2022-02-20 18:51:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:36,401 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:51:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:36,402 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:51:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1191 transitions. [2022-02-20 18:51:36,416 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:51:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1191 transitions. [2022-02-20 18:51:36,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1191 transitions. [2022-02-20 18:51:37,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1191 edges. 1191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:37,185 INFO L225 Difference]: With dead ends: 704 [2022-02-20 18:51:37,185 INFO L226 Difference]: Without dead ends: 428 [2022-02-20 18:51:37,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:37,190 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 1869 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1869 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:37,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1869 Valid, 500 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-02-20 18:51:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 386. [2022-02-20 18:51:37,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:37,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 386 states, 375 states have (on average 1.3546666666666667) internal successors, (508), 385 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,336 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 386 states, 375 states have (on average 1.3546666666666667) internal successors, (508), 385 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,337 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 386 states, 375 states have (on average 1.3546666666666667) internal successors, (508), 385 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:37,348 INFO L93 Difference]: Finished difference Result 428 states and 546 transitions. [2022-02-20 18:51:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 546 transitions. [2022-02-20 18:51:37,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:37,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:37,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 375 states have (on average 1.3546666666666667) internal successors, (508), 385 states have internal predecessors, (508), 0 states have call successors, (0), 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 428 states. [2022-02-20 18:51:37,351 INFO L87 Difference]: Start difference. First operand has 386 states, 375 states have (on average 1.3546666666666667) internal successors, (508), 385 states have internal predecessors, (508), 0 states have call successors, (0), 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 428 states. [2022-02-20 18:51:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:37,362 INFO L93 Difference]: Finished difference Result 428 states and 546 transitions. [2022-02-20 18:51:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 546 transitions. [2022-02-20 18:51:37,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:37,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:37,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:37,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 375 states have (on average 1.3546666666666667) internal successors, (508), 385 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 508 transitions. [2022-02-20 18:51:37,375 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 508 transitions. Word has length 59 [2022-02-20 18:51:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:37,376 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 508 transitions. [2022-02-20 18:51:37,376 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:51:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 508 transitions. [2022-02-20 18:51:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:51:37,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:37,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:37,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:51:37,377 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2133391140, now seen corresponding path program 1 times [2022-02-20 18:51:37,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:37,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704474668] [2022-02-20 18:51:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:37,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:37,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {2549#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {2551#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {2551#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:37,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {2551#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {2552#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:51:37,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {2552#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {2552#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:51:37,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {2552#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {2553#(<= (+ ~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; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {2553#(<= (+ ~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; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {2553#(<= (+ ~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~6#1;main_~node3__m3~6#1 := ~nomsg~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} 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~12#1;main_~node4__m4~12#1 := ~nomsg~0; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {2553#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:37,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {2553#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~4#1 := ~p4_new~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~4#1 % 256 else main_~node4____CPAchecker_TMP_0~4#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~23#1; {2550#false} is VALID [2022-02-20 18:51:37,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2550#false} is VALID [2022-02-20 18:51:37,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} assume !(~r1~0 >= 4); {2550#false} is VALID [2022-02-20 18:51:37,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {2550#false} is VALID [2022-02-20 18:51:37,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {2550#false} assume ~r1~0 < 4;main_~check__tmp~23#1 := 1;~__return_3981~0 := main_~check__tmp~23#1;main_~main__c1~0#1 := ~__return_3981~0;havoc main_~__tmp_20~0#1;main_~__tmp_20~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~19#1;main_~assert__arg~19#1 := main_~__tmp_20~0#1; {2550#false} is VALID [2022-02-20 18:51:37,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} assume !(0 == main_~assert__arg~19#1 % 256);main_~main____CPAchecker_TMP_0~9#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~9#1; {2550#false} is VALID [2022-02-20 18:51:37,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {2550#false} is VALID [2022-02-20 18:51:37,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {2550#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {2550#false} assume main_~node1__m1~1#1 != ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {2550#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2550#false} is VALID [2022-02-20 18:51:37,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {2550#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,490 INFO L290 TraceCheckUtils]: 47: Hoare triple {2550#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {2550#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {2550#false} is VALID [2022-02-20 18:51:37,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {2550#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {2550#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {2550#false} assume main_~node3__m3~4#1 != ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {2550#false} assume !(main_~node3__m3~4#1 > ~id3~0); {2550#false} is VALID [2022-02-20 18:51:37,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {2550#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {2550#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2550#false} is VALID [2022-02-20 18:51:37,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {2550#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {2550#false} is VALID [2022-02-20 18:51:37,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {2550#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~12#1; {2550#false} is VALID [2022-02-20 18:51:37,496 INFO L290 TraceCheckUtils]: 57: Hoare triple {2550#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3746~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3746~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; {2550#false} is VALID [2022-02-20 18:51:37,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {2550#false} assume 0 == main_~assert__arg~11#1 % 256; {2550#false} is VALID [2022-02-20 18:51:37,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-02-20 18:51:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:37,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:37,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704474668] [2022-02-20 18:51:37,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704474668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:37,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:37,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:37,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573609486] [2022-02-20 18:51:37,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:37,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:51:37,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:37,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:37,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:37,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:37,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:37,535 INFO L87 Difference]: Start difference. First operand 386 states and 508 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:38,241 INFO L93 Difference]: Finished difference Result 681 states and 918 transitions. [2022-02-20 18:51:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:38,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:51:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2022-02-20 18:51:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2022-02-20 18:51:38,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 638 transitions. [2022-02-20 18:51:38,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:38,653 INFO L225 Difference]: With dead ends: 681 [2022-02-20 18:51:38,653 INFO L226 Difference]: Without dead ends: 366 [2022-02-20 18:51:38,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:38,655 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 935 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:38,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [935 Valid, 210 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-02-20 18:51:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-02-20 18:51:38,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:38,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 366 states, 355 states have (on average 1.3577464788732394) internal successors, (482), 365 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,843 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 366 states, 355 states have (on average 1.3577464788732394) internal successors, (482), 365 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,843 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 366 states, 355 states have (on average 1.3577464788732394) internal successors, (482), 365 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:38,852 INFO L93 Difference]: Finished difference Result 366 states and 482 transitions. [2022-02-20 18:51:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 482 transitions. [2022-02-20 18:51:38,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:38,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:38,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 366 states, 355 states have (on average 1.3577464788732394) internal successors, (482), 365 states have internal predecessors, (482), 0 states have call successors, (0), 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 366 states. [2022-02-20 18:51:38,854 INFO L87 Difference]: Start difference. First operand has 366 states, 355 states have (on average 1.3577464788732394) internal successors, (482), 365 states have internal predecessors, (482), 0 states have call successors, (0), 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 366 states. [2022-02-20 18:51:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:38,862 INFO L93 Difference]: Finished difference Result 366 states and 482 transitions. [2022-02-20 18:51:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 482 transitions. [2022-02-20 18:51:38,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:38,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:38,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:38,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 355 states have (on average 1.3577464788732394) internal successors, (482), 365 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 482 transitions. [2022-02-20 18:51:38,870 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 482 transitions. Word has length 60 [2022-02-20 18:51:38,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:38,871 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 482 transitions. [2022-02-20 18:51:38,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 482 transitions. [2022-02-20 18:51:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:51:38,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:38,872 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:51:38,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:51:38,872 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:38,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash 626465560, now seen corresponding path program 1 times [2022-02-20 18:51:38,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:38,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184179536] [2022-02-20 18:51:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:38,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {4588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {4590#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:38,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {4590#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {4590#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:38,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {4590#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {4590#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:38,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {4590#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {4590#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:38,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {4590#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {4590#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:38,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {4590#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {4590#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:38,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {4590#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {4590#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:38,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {4590#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {4591#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:38,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {4591#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {4591#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:38,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {4591#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:38,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {4592#(<= (+ ~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; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {4592#(<= (+ ~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; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4592#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:39,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {4592#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {4589#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {4589#false} is VALID [2022-02-20 18:51:39,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {4589#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~12#1;main_~node4__m4~12#1 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {4589#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {4589#false} is VALID [2022-02-20 18:51:39,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {4589#false} assume ~send4~0 != ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {4589#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~4#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~4#1 % 256 else main_~node4____CPAchecker_TMP_0~4#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~22#1; {4589#false} is VALID [2022-02-20 18:51:39,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {4589#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {4589#false} is VALID [2022-02-20 18:51:39,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {4589#false} assume !(~r1~0 >= 4); {4589#false} is VALID [2022-02-20 18:51:39,004 INFO L290 TraceCheckUtils]: 39: Hoare triple {4589#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {4589#false} is VALID [2022-02-20 18:51:39,004 INFO L290 TraceCheckUtils]: 40: Hoare triple {4589#false} assume ~r1~0 < 4;main_~check__tmp~22#1 := 1;~__return_4081~0 := main_~check__tmp~22#1;main_~main__c1~0#1 := ~__return_4081~0;havoc main_~__tmp_19~0#1;main_~__tmp_19~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~18#1;main_~assert__arg~18#1 := main_~__tmp_19~0#1; {4589#false} is VALID [2022-02-20 18:51:39,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {4589#false} assume !(0 == main_~assert__arg~18#1 % 256);main_~main____CPAchecker_TMP_0~8#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~8#1; {4589#false} is VALID [2022-02-20 18:51:39,004 INFO L290 TraceCheckUtils]: 42: Hoare triple {4589#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {4589#false} is VALID [2022-02-20 18:51:39,004 INFO L290 TraceCheckUtils]: 43: Hoare triple {4589#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {4589#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {4589#false} assume main_~node1__m1~1#1 != ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,004 INFO L290 TraceCheckUtils]: 46: Hoare triple {4589#false} assume !(main_~node1__m1~1#1 > ~id1~0); {4589#false} is VALID [2022-02-20 18:51:39,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {4589#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {4589#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {4589#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {4589#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {4589#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {4589#false} assume main_~node3__m3~4#1 != ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {4589#false} assume !(main_~node3__m3~4#1 > ~id3~0); {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 54: Hoare triple {4589#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 55: Hoare triple {4589#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 56: Hoare triple {4589#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 57: Hoare triple {4589#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~12#1; {4589#false} is VALID [2022-02-20 18:51:39,005 INFO L290 TraceCheckUtils]: 58: Hoare triple {4589#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3746~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3746~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; {4589#false} is VALID [2022-02-20 18:51:39,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {4589#false} assume 0 == main_~assert__arg~11#1 % 256; {4589#false} is VALID [2022-02-20 18:51:39,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {4589#false} assume !false; {4589#false} is VALID [2022-02-20 18:51:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:39,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:39,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184179536] [2022-02-20 18:51:39,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184179536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:39,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:39,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:39,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26501813] [2022-02-20 18:51:39,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:39,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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:51:39,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:39,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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:51:39,042 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:51:39,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:39,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:39,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:39,043 INFO L87 Difference]: Start difference. First operand 366 states and 482 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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:51:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,760 INFO L93 Difference]: Finished difference Result 661 states and 890 transitions. [2022-02-20 18:51:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:39,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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:51:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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:51:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-02-20 18:51:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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:51:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-02-20 18:51:39,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 612 transitions. [2022-02-20 18:51:40,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:40,134 INFO L225 Difference]: With dead ends: 661 [2022-02-20 18:51:40,134 INFO L226 Difference]: Without dead ends: 347 [2022-02-20 18:51:40,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:40,135 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 907 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:40,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [907 Valid, 199 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-02-20 18:51:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2022-02-20 18:51:40,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:40,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 347 states, 336 states have (on average 1.3660714285714286) internal successors, (459), 346 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,362 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 347 states, 336 states have (on average 1.3660714285714286) internal successors, (459), 346 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,363 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 347 states, 336 states have (on average 1.3660714285714286) internal successors, (459), 346 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:40,369 INFO L93 Difference]: Finished difference Result 347 states and 459 transitions. [2022-02-20 18:51:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 459 transitions. [2022-02-20 18:51:40,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:40,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:40,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 347 states, 336 states have (on average 1.3660714285714286) internal successors, (459), 346 states have internal predecessors, (459), 0 states have call successors, (0), 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 347 states. [2022-02-20 18:51:40,371 INFO L87 Difference]: Start difference. First operand has 347 states, 336 states have (on average 1.3660714285714286) internal successors, (459), 346 states have internal predecessors, (459), 0 states have call successors, (0), 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 347 states. [2022-02-20 18:51:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:40,376 INFO L93 Difference]: Finished difference Result 347 states and 459 transitions. [2022-02-20 18:51:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 459 transitions. [2022-02-20 18:51:40,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:40,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:40,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:40,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 336 states have (on average 1.3660714285714286) internal successors, (459), 346 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 459 transitions. [2022-02-20 18:51:40,383 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 459 transitions. Word has length 61 [2022-02-20 18:51:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:40,384 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 459 transitions. [2022-02-20 18:51:40,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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:51:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 459 transitions. [2022-02-20 18:51:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:51:40,384 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:40,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:40,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:51:40,385 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash 55190193, now seen corresponding path program 1 times [2022-02-20 18:51:40,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:40,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209160596] [2022-02-20 18:51:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:40,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {6550#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {6552#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {6552#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:40,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {6552#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {6553#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:40,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {6553#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {6553#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:40,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {6553#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {6554#(<= (+ ~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; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {6554#(<= (+ ~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; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {6554#(<= (+ ~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; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {6554#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6554#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:40,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {6554#(<= (+ ~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~10#1;main_~node4__m4~10#1 := ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {6551#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~2#1; {6551#false} is VALID [2022-02-20 18:51:40,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {6551#false} assume ~send4~0 != ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {6551#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~2#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~2#1 % 256 else main_~node4____CPAchecker_TMP_0~2#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~18#1; {6551#false} is VALID [2022-02-20 18:51:40,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {6551#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6551#false} is VALID [2022-02-20 18:51:40,491 INFO L290 TraceCheckUtils]: 39: Hoare triple {6551#false} assume !(~r1~0 >= 4); {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {6551#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {6551#false} assume ~r1~0 < 4;main_~check__tmp~18#1 := 1;~__return_4445~0 := main_~check__tmp~18#1;main_~main__c1~0#1 := ~__return_4445~0;havoc main_~__tmp_15~0#1;main_~__tmp_15~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~14#1;main_~assert__arg~14#1 := main_~__tmp_15~0#1; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {6551#false} assume !(0 == main_~assert__arg~14#1 % 256);main_~main____CPAchecker_TMP_0~4#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~4#1; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {6551#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {6551#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {6551#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {6551#false} assume main_~node1__m1~1#1 != ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {6551#false} assume !(main_~node1__m1~1#1 > ~id1~0); {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {6551#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {6551#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {6551#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {6551#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {6551#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L290 TraceCheckUtils]: 53: Hoare triple {6551#false} assume main_~node3__m3~4#1 != ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L290 TraceCheckUtils]: 54: Hoare triple {6551#false} assume !(main_~node3__m3~4#1 > ~id3~0); {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {6551#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {6551#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L290 TraceCheckUtils]: 57: Hoare triple {6551#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {6551#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~12#1; {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {6551#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3746~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3746~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; {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {6551#false} assume 0 == main_~assert__arg~11#1 % 256; {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {6551#false} assume !false; {6551#false} is VALID [2022-02-20 18:51:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:40,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:40,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209160596] [2022-02-20 18:51:40,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209160596] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:40,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:40,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:40,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285469296] [2022-02-20 18:51:40,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:40,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:51:40,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:40,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:40,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:40,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:40,536 INFO L87 Difference]: Start difference. First operand 347 states and 459 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:41,313 INFO L93 Difference]: Finished difference Result 642 states and 865 transitions. [2022-02-20 18:51:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:41,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:51:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-02-20 18:51:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-02-20 18:51:41,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-02-20 18:51:41,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:41,673 INFO L225 Difference]: With dead ends: 642 [2022-02-20 18:51:41,674 INFO L226 Difference]: Without dead ends: 339 [2022-02-20 18:51:41,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:41,675 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 860 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:41,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 195 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-02-20 18:51:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-02-20 18:51:41,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:41,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 339 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 338 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:41,981 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 339 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 338 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:41,983 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 339 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 338 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:41,988 INFO L93 Difference]: Finished difference Result 339 states and 448 transitions. [2022-02-20 18:51:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 448 transitions. [2022-02-20 18:51:41,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:41,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:41,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 338 states have internal predecessors, (448), 0 states have call successors, (0), 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 339 states. [2022-02-20 18:51:41,990 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 338 states have internal predecessors, (448), 0 states have call successors, (0), 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 339 states. [2022-02-20 18:51:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:41,996 INFO L93 Difference]: Finished difference Result 339 states and 448 transitions. [2022-02-20 18:51:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 448 transitions. [2022-02-20 18:51:41,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:41,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:41,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:41,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 338 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 448 transitions. [2022-02-20 18:51:42,003 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 448 transitions. Word has length 62 [2022-02-20 18:51:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:42,004 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 448 transitions. [2022-02-20 18:51:42,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 448 transitions. [2022-02-20 18:51:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:51:42,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:42,006 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:51:42,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:51:42,006 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1176799625, now seen corresponding path program 1 times [2022-02-20 18:51:42,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:42,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871460545] [2022-02-20 18:51:42,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:42,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:42,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {8469#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {8471#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:42,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {8471#(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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {8472#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {8472#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {8472#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {8472#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {8473#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {8473#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {8473#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {8473#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:42,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {8474#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8475#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:42,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {8475#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8475#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:42,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {8475#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {8475#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:42,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {8475#(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; {8475#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:42,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {8475#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8475#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:42,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {8475#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {8475#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:42,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {8475#(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; {8475#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:42,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {8475#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {8475#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:42,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {8475#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {8475#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:42,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {8475#(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; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 4); {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,212 INFO L290 TraceCheckUtils]: 46: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {8476#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:42,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {8476#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8477#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} is VALID [2022-02-20 18:51:42,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {8477#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {8470#false} is VALID [2022-02-20 18:51:42,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {8470#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {8470#false} is VALID [2022-02-20 18:51:42,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {8470#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8470#false} is VALID [2022-02-20 18:51:42,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {8470#false} assume main_~node3__m3~4#1 != ~nomsg~0; {8470#false} is VALID [2022-02-20 18:51:42,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {8470#false} assume !(main_~node3__m3~4#1 > ~id3~0); {8470#false} is VALID [2022-02-20 18:51:42,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {8470#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {8470#false} is VALID [2022-02-20 18:51:42,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {8470#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8470#false} is VALID [2022-02-20 18:51:42,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {8470#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {8470#false} is VALID [2022-02-20 18:51:42,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {8470#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~12#1; {8470#false} is VALID [2022-02-20 18:51:42,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {8470#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3746~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3746~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; {8470#false} is VALID [2022-02-20 18:51:42,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {8470#false} assume 0 == main_~assert__arg~11#1 % 256; {8470#false} is VALID [2022-02-20 18:51:42,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {8470#false} assume !false; {8470#false} is VALID [2022-02-20 18:51:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:42,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:42,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871460545] [2022-02-20 18:51:42,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871460545] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:42,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:42,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:42,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870208055] [2022-02-20 18:51:42,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:42,217 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:51:42,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:42,217 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:51:42,261 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:51:42,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:42,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:42,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:42,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:42,263 INFO L87 Difference]: Start difference. First operand 339 states and 448 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:51:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:45,489 INFO L93 Difference]: Finished difference Result 890 states and 1229 transitions. [2022-02-20 18:51:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 18:51:45,489 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:51:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:45,490 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:51:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 934 transitions. [2022-02-20 18:51:45,497 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:51:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 934 transitions. [2022-02-20 18:51:45,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 934 transitions. [2022-02-20 18:51:46,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 934 edges. 934 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:46,187 INFO L225 Difference]: With dead ends: 890 [2022-02-20 18:51:46,187 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 18:51:46,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:51:46,189 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 1772 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:46,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1772 Valid, 1064 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:51:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 18:51:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 339. [2022-02-20 18:51:46,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:46,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 339 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 338 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,555 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 339 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 338 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,555 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 339 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 338 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:46,574 INFO L93 Difference]: Finished difference Result 750 states and 1028 transitions. [2022-02-20 18:51:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1028 transitions. [2022-02-20 18:51:46,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:46,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:46,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 338 states have internal predecessors, (447), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:51:46,577 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 338 states have internal predecessors, (447), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:51:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:46,595 INFO L93 Difference]: Finished difference Result 750 states and 1028 transitions. [2022-02-20 18:51:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1028 transitions. [2022-02-20 18:51:46,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:46,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:46,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:46,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 338 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 447 transitions. [2022-02-20 18:51:46,603 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 447 transitions. Word has length 63 [2022-02-20 18:51:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:46,604 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 447 transitions. [2022-02-20 18:51:46,604 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:51:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 447 transitions. [2022-02-20 18:51:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:51:46,605 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:46,605 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:51:46,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:51:46,605 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1585644853, now seen corresponding path program 1 times [2022-02-20 18:51:46,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:46,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041059335] [2022-02-20 18:51:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:46,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:46,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {11615#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {11617#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:46,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {11617#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:46,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:46,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:46,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:46,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:46,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:46,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {11618#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {11619#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:46,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {11619#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {11619#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:46,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {11619#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {11620#(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; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {11620#(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; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {11620#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:46,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {11620#(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; {11621#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:46,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {11621#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11621#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:46,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {11621#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {11621#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:46,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {11621#(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; {11621#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:46,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {11621#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {11621#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:46,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {11621#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {11621#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:46,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {11621#(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; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,714 INFO L290 TraceCheckUtils]: 41: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {11622#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:46,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {11622#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11623#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} is VALID [2022-02-20 18:51:46,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {11623#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {11616#false} is VALID [2022-02-20 18:51:46,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {11616#false} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {11616#false} is VALID [2022-02-20 18:51:46,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {11616#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11616#false} is VALID [2022-02-20 18:51:46,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {11616#false} assume !(main_~node4__m4~8#1 != ~nomsg~0);~mode4~0 := 0; {11616#false} is VALID [2022-02-20 18:51:46,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {11616#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~14#1; {11616#false} is VALID [2022-02-20 18:51:46,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {11616#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~14#1 := 0;~__return_4143~0 := main_~check__tmp~14#1;main_~main__c1~0#1 := ~__return_4143~0;havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~12#1;main_~assert__arg~12#1 := main_~__tmp_13~0#1; {11616#false} is VALID [2022-02-20 18:51:46,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {11616#false} assume 0 == main_~assert__arg~12#1 % 256; {11616#false} is VALID [2022-02-20 18:51:46,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {11616#false} assume !false; {11616#false} is VALID [2022-02-20 18:51:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:46,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:46,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041059335] [2022-02-20 18:51:46,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041059335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:46,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:46,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:46,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124935172] [2022-02-20 18:51:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:46,721 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:51:46,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:46,721 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:51:46,758 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:51:46,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:46,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:46,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:46,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:46,759 INFO L87 Difference]: Start difference. First operand 339 states and 447 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:51:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:50,021 INFO L93 Difference]: Finished difference Result 884 states and 1227 transitions. [2022-02-20 18:51:50,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:50,022 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:51:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:50,022 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:51:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 739 transitions. [2022-02-20 18:51:50,025 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:51:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 739 transitions. [2022-02-20 18:51:50,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 739 transitions. [2022-02-20 18:51:50,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 739 edges. 739 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:50,524 INFO L225 Difference]: With dead ends: 884 [2022-02-20 18:51:50,524 INFO L226 Difference]: Without dead ends: 766 [2022-02-20 18:51:50,525 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:51:50,525 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 1850 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:50,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1850 Valid, 996 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:51:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-02-20 18:51:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 339. [2022-02-20 18:51:51,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:51,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 766 states. Second operand has 339 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 338 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,043 INFO L74 IsIncluded]: Start isIncluded. First operand 766 states. Second operand has 339 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 338 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,044 INFO L87 Difference]: Start difference. First operand 766 states. Second operand has 339 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 338 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:51,062 INFO L93 Difference]: Finished difference Result 766 states and 1054 transitions. [2022-02-20 18:51:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1054 transitions. [2022-02-20 18:51:51,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:51,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:51,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 338 states have internal predecessors, (446), 0 states have call successors, (0), 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 766 states. [2022-02-20 18:51:51,064 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 338 states have internal predecessors, (446), 0 states have call successors, (0), 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 766 states. [2022-02-20 18:51:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:51,082 INFO L93 Difference]: Finished difference Result 766 states and 1054 transitions. [2022-02-20 18:51:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1054 transitions. [2022-02-20 18:51:51,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:51,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:51,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:51,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 338 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 446 transitions. [2022-02-20 18:51:51,089 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 446 transitions. Word has length 63 [2022-02-20 18:51:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:51,090 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 446 transitions. [2022-02-20 18:51:51,090 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:51:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 446 transitions. [2022-02-20 18:51:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:51:51,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:51,091 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:51:51,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:51:51,091 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 202563885, now seen corresponding path program 1 times [2022-02-20 18:51:51,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:51,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754252429] [2022-02-20 18:51:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:51,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:51,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {14780#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {14782#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:51,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {14782#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {14783#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {14784#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} is VALID [2022-02-20 18:51:51,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {14784#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} assume 0 == ~st4~0; {14784#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} is VALID [2022-02-20 18:51:51,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {14784#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} assume ~send4~0 == ~id4~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {14785#(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; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {14785#(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; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {14785#(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; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {14785#(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; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 != ~nomsg~0; {14785#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:51,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {14785#(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; {14786#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:51,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {14786#(not (= ~nomsg~0 ~p4_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {14786#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:51,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {14786#(not (= ~nomsg~0 ~p4_old~0))} assume !(~r1~0 >= 4); {14786#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:51,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {14786#(not (= ~nomsg~0 ~p4_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {14786#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:51,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {14786#(not (= ~nomsg~0 ~p4_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {14786#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:51,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {14786#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {14786#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:51,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {14786#(not (= ~nomsg~0 ~p4_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {14786#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:51,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {14786#(not (= ~nomsg~0 ~p4_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14786#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:51:51,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {14786#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {14787#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:51,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {14787#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {14781#false} is VALID [2022-02-20 18:51:51,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {14781#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14781#false} is VALID [2022-02-20 18:51:51,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {14781#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14781#false} is VALID [2022-02-20 18:51:51,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {14781#false} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {14781#false} is VALID [2022-02-20 18:51:51,219 INFO L290 TraceCheckUtils]: 51: Hoare triple {14781#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {14781#false} is VALID [2022-02-20 18:51:51,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {14781#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14781#false} is VALID [2022-02-20 18:51:51,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {14781#false} assume main_~node3__m3~1#1 != ~nomsg~0; {14781#false} is VALID [2022-02-20 18:51:51,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {14781#false} assume !(main_~node3__m3~1#1 > ~id3~0); {14781#false} is VALID [2022-02-20 18:51:51,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {14781#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {14781#false} is VALID [2022-02-20 18:51:51,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {14781#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14781#false} is VALID [2022-02-20 18:51:51,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {14781#false} assume main_~node4__m4~3#1 != ~nomsg~0; {14781#false} is VALID [2022-02-20 18:51:51,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {14781#false} assume !(main_~node4__m4~3#1 > ~id4~0); {14781#false} is VALID [2022-02-20 18:51:51,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {14781#false} assume main_~node4__m4~3#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~5#1; {14781#false} is VALID [2022-02-20 18:51:51,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {14781#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~5#1 := 0;~__return_3835~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_3835~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {14781#false} is VALID [2022-02-20 18:51:51,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {14781#false} assume 0 == main_~assert__arg~5#1 % 256; {14781#false} is VALID [2022-02-20 18:51:51,221 INFO L290 TraceCheckUtils]: 62: Hoare triple {14781#false} assume !false; {14781#false} is VALID [2022-02-20 18:51:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:51,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:51,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754252429] [2022-02-20 18:51:51,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754252429] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:51,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:51,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:51:51,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165021815] [2022-02-20 18:51:51,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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:51:51,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:51,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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:51:51,259 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:51:51,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:51:51,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:51:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:51:51,260 INFO L87 Difference]: Start difference. First operand 339 states and 446 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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:51:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:53,283 INFO L93 Difference]: Finished difference Result 689 states and 911 transitions. [2022-02-20 18:51:53,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:51:53,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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:51:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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:51:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 611 transitions. [2022-02-20 18:51:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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:51:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 611 transitions. [2022-02-20 18:51:53,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 611 transitions. [2022-02-20 18:51:53,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:53,693 INFO L225 Difference]: With dead ends: 689 [2022-02-20 18:51:53,693 INFO L226 Difference]: Without dead ends: 504 [2022-02-20 18:51:53,693 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:51:53,694 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 1471 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:53,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1471 Valid, 448 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-02-20 18:51:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 339. [2022-02-20 18:51:54,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:54,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 504 states. Second operand has 339 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 338 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:54,292 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand has 339 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 338 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:54,292 INFO L87 Difference]: Start difference. First operand 504 states. Second operand has 339 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 338 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:54,302 INFO L93 Difference]: Finished difference Result 504 states and 657 transitions. [2022-02-20 18:51:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 657 transitions. [2022-02-20 18:51:54,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:54,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:54,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 338 states have internal predecessors, (445), 0 states have call successors, (0), 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 504 states. [2022-02-20 18:51:54,303 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 338 states have internal predecessors, (445), 0 states have call successors, (0), 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 504 states. [2022-02-20 18:51:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:54,313 INFO L93 Difference]: Finished difference Result 504 states and 657 transitions. [2022-02-20 18:51:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 657 transitions. [2022-02-20 18:51:54,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:54,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:54,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:54,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 338 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 445 transitions. [2022-02-20 18:51:54,319 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 445 transitions. Word has length 63 [2022-02-20 18:51:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:54,320 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 445 transitions. [2022-02-20 18:51:54,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 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:51:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 445 transitions. [2022-02-20 18:51:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:51:54,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:54,321 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:51:54,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:51:54,321 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash -620136770, now seen corresponding path program 1 times [2022-02-20 18:51:54,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:54,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455739649] [2022-02-20 18:51:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:54,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {17125#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {17127#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:54,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {17127#(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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {17128#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {17129#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {17129#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {17129#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:54,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {17129#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode3~0 % 256; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id4~0 >= 0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~st4~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send4~0 == ~id4~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode4~0 % 256; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id2~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id3~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id4~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id3~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id4~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send1~0 != ~nomsg~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send2~0 != ~nomsg~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send3~0 != ~nomsg~0; {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:54,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {17130#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {17131#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {17131#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {17131#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {17131#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {17131#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {17131#(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; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} ~mode2~0 := 0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~4#1 != ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~4#1 > ~id3~0); {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {17132#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:54,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {17132#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {17133#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} is VALID [2022-02-20 18:51:54,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {17133#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {17126#false} is VALID [2022-02-20 18:51:54,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {17126#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~12#1; {17126#false} is VALID [2022-02-20 18:51:54,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {17126#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3746~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3746~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; {17126#false} is VALID [2022-02-20 18:51:54,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {17126#false} assume 0 == main_~assert__arg~11#1 % 256; {17126#false} is VALID [2022-02-20 18:51:54,445 INFO L290 TraceCheckUtils]: 64: Hoare triple {17126#false} assume !false; {17126#false} is VALID [2022-02-20 18:51:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:54,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:54,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455739649] [2022-02-20 18:51:54,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455739649] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:54,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:54,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:54,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147453922] [2022-02-20 18:51:54,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:54,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:51:54,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:54,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:54,493 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:51:54,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:54,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:54,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:54,494 INFO L87 Difference]: Start difference. First operand 339 states and 445 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:58,317 INFO L93 Difference]: Finished difference Result 857 states and 1181 transitions. [2022-02-20 18:51:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:58,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:51:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 712 transitions. [2022-02-20 18:51:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 712 transitions. [2022-02-20 18:51:58,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 712 transitions. [2022-02-20 18:51:58,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 712 edges. 712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:58,848 INFO L225 Difference]: With dead ends: 857 [2022-02-20 18:51:58,849 INFO L226 Difference]: Without dead ends: 746 [2022-02-20 18:51:58,849 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:51:58,851 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 1778 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:58,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1778 Valid, 953 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:51:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-02-20 18:51:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 339. [2022-02-20 18:51:59,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:59,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.353658536585366) internal successors, (444), 338 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:59,536 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.353658536585366) internal successors, (444), 338 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:59,537 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.353658536585366) internal successors, (444), 338 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:59,554 INFO L93 Difference]: Finished difference Result 746 states and 1017 transitions. [2022-02-20 18:51:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1017 transitions. [2022-02-20 18:51:59,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:59,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:59,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.353658536585366) internal successors, (444), 338 states have internal predecessors, (444), 0 states have call successors, (0), 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 746 states. [2022-02-20 18:51:59,561 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.353658536585366) internal successors, (444), 338 states have internal predecessors, (444), 0 states have call successors, (0), 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 746 states. [2022-02-20 18:51:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:59,578 INFO L93 Difference]: Finished difference Result 746 states and 1017 transitions. [2022-02-20 18:51:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1017 transitions. [2022-02-20 18:51:59,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:59,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:59,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:59,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.353658536585366) internal successors, (444), 338 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 444 transitions. [2022-02-20 18:51:59,584 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 444 transitions. Word has length 65 [2022-02-20 18:51:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:59,585 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 444 transitions. [2022-02-20 18:51:59,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 444 transitions. [2022-02-20 18:51:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:51:59,585 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:59,585 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:51:59,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:51:59,586 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:51:59,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1292060332, now seen corresponding path program 1 times [2022-02-20 18:51:59,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:59,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738578310] [2022-02-20 18:51:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:59,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {20221#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {20223#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:59,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {20223#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:59,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:59,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:59,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:59,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:59,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:59,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {20224#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {20225#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:59,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {20225#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {20225#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:59,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {20225#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {20226#(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; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {20226#(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; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {20226#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:59,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {20226#(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; {20227#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:59,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {20227#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {20227#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:59,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {20227#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {20227#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:59,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {20227#(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; {20227#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:59,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {20227#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {20227#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:59,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {20227#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {20227#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:59,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {20227#(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; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {20228#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:59,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {20228#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20229#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:51:59,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {20229#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {20222#false} is VALID [2022-02-20 18:51:59,701 INFO L290 TraceCheckUtils]: 57: Hoare triple {20222#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {20222#false} is VALID [2022-02-20 18:51:59,701 INFO L290 TraceCheckUtils]: 58: Hoare triple {20222#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20222#false} is VALID [2022-02-20 18:51:59,701 INFO L290 TraceCheckUtils]: 59: Hoare triple {20222#false} assume main_~node4__m4~6#1 != ~nomsg~0; {20222#false} is VALID [2022-02-20 18:51:59,701 INFO L290 TraceCheckUtils]: 60: Hoare triple {20222#false} assume !(main_~node4__m4~6#1 > ~id4~0); {20222#false} is VALID [2022-02-20 18:51:59,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {20222#false} assume main_~node4__m4~6#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; {20222#false} is VALID [2022-02-20 18:51:59,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {20222#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_3543~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_3543~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; {20222#false} is VALID [2022-02-20 18:51:59,702 INFO L290 TraceCheckUtils]: 63: Hoare triple {20222#false} assume 0 == main_~assert__arg~10#1 % 256; {20222#false} is VALID [2022-02-20 18:51:59,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {20222#false} assume !false; {20222#false} is VALID [2022-02-20 18:51:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:59,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:59,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738578310] [2022-02-20 18:51:59,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738578310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:59,703 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:59,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:59,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281461700] [2022-02-20 18:51:59,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:59,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:51:59,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:59,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:59,747 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:51:59,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:59,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:59,748 INFO L87 Difference]: Start difference. First operand 339 states and 444 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:03,440 INFO L93 Difference]: Finished difference Result 889 states and 1228 transitions. [2022-02-20 18:52:03,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:03,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 740 transitions. [2022-02-20 18:52:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 740 transitions. [2022-02-20 18:52:03,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 740 transitions. [2022-02-20 18:52:03,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 740 edges. 740 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:03,917 INFO L225 Difference]: With dead ends: 889 [2022-02-20 18:52:03,917 INFO L226 Difference]: Without dead ends: 766 [2022-02-20 18:52:03,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:03,918 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 1583 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:03,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1583 Valid, 1116 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-02-20 18:52:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 339. [2022-02-20 18:52:04,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:04,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 766 states. Second operand has 339 states, 328 states have (on average 1.350609756097561) internal successors, (443), 338 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,599 INFO L74 IsIncluded]: Start isIncluded. First operand 766 states. Second operand has 339 states, 328 states have (on average 1.350609756097561) internal successors, (443), 338 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,600 INFO L87 Difference]: Start difference. First operand 766 states. Second operand has 339 states, 328 states have (on average 1.350609756097561) internal successors, (443), 338 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:04,628 INFO L93 Difference]: Finished difference Result 766 states and 1049 transitions. [2022-02-20 18:52:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1049 transitions. [2022-02-20 18:52:04,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:04,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:04,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.350609756097561) internal successors, (443), 338 states have internal predecessors, (443), 0 states have call successors, (0), 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 766 states. [2022-02-20 18:52:04,630 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.350609756097561) internal successors, (443), 338 states have internal predecessors, (443), 0 states have call successors, (0), 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 766 states. [2022-02-20 18:52:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:04,647 INFO L93 Difference]: Finished difference Result 766 states and 1049 transitions. [2022-02-20 18:52:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1049 transitions. [2022-02-20 18:52:04,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:04,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:04,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:04,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.350609756097561) internal successors, (443), 338 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 443 transitions. [2022-02-20 18:52:04,653 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 443 transitions. Word has length 65 [2022-02-20 18:52:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:04,657 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 443 transitions. [2022-02-20 18:52:04,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 443 transitions. [2022-02-20 18:52:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:04,658 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:04,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:04,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:04,658 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:04,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:04,659 INFO L85 PathProgramCache]: Analyzing trace with hash -109241464, now seen corresponding path program 1 times [2022-02-20 18:52:04,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:04,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926470906] [2022-02-20 18:52:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:04,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:04,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {23391#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {23393#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:04,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {23393#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {23394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {23395#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {23395#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {23395#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:04,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {23395#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {23396#(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; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {23396#(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; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {23396#(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; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {23396#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:04,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {23396#(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; {23397#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {23397#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {23397#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {23397#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {23397#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {23397#(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; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 != ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~5#1 > ~id3~0); {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~9#1;main_~node4__m4~9#1 := ~nomsg~0; {23398#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:04,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {23398#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23399#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~9#1|))} is VALID [2022-02-20 18:52:04,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {23399#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~9#1|))} assume !(main_~node4__m4~9#1 != ~nomsg~0);~mode4~0 := 0; {23392#false} is VALID [2022-02-20 18:52:04,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {23392#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~16#1; {23392#false} is VALID [2022-02-20 18:52:04,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {23392#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~16#1 := 0;~__return_4495~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_4495~0;~__tmp_3196_0~0 := main_~main____CPAchecker_TMP_0~0#1; {23392#false} is VALID [2022-02-20 18:52:04,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {23392#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_3196_0~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; {23392#false} is VALID [2022-02-20 18:52:04,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {23392#false} assume 0 == main_~assert__arg~2#1 % 256; {23392#false} is VALID [2022-02-20 18:52:04,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {23392#false} assume !false; {23392#false} is VALID [2022-02-20 18:52:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:04,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:04,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926470906] [2022-02-20 18:52:04,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926470906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:04,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:04,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:04,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863718888] [2022-02-20 18:52:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:04,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:04,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:04,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:04,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:04,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:04,808 INFO L87 Difference]: Start difference. First operand 339 states and 443 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:08,532 INFO L93 Difference]: Finished difference Result 854 states and 1176 transitions. [2022-02-20 18:52:08,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:08,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 707 transitions. [2022-02-20 18:52:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 707 transitions. [2022-02-20 18:52:08,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 707 transitions. [2022-02-20 18:52:08,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 707 edges. 707 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:08,988 INFO L225 Difference]: With dead ends: 854 [2022-02-20 18:52:08,988 INFO L226 Difference]: Without dead ends: 746 [2022-02-20 18:52:08,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:08,990 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 949 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:08,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [949 Valid, 973 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-02-20 18:52:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 339. [2022-02-20 18:52:09,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:09,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.3475609756097562) internal successors, (442), 338 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,802 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.3475609756097562) internal successors, (442), 338 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,802 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.3475609756097562) internal successors, (442), 338 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,817 INFO L93 Difference]: Finished difference Result 746 states and 1015 transitions. [2022-02-20 18:52:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1015 transitions. [2022-02-20 18:52:09,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.3475609756097562) internal successors, (442), 338 states have internal predecessors, (442), 0 states have call successors, (0), 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 746 states. [2022-02-20 18:52:09,819 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.3475609756097562) internal successors, (442), 338 states have internal predecessors, (442), 0 states have call successors, (0), 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 746 states. [2022-02-20 18:52:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,834 INFO L93 Difference]: Finished difference Result 746 states and 1015 transitions. [2022-02-20 18:52:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1015 transitions. [2022-02-20 18:52:09,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:09,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3475609756097562) internal successors, (442), 338 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2022-02-20 18:52:09,840 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 65 [2022-02-20 18:52:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:09,841 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2022-02-20 18:52:09,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-02-20 18:52:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:09,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:09,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:09,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:09,842 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1375273345, now seen corresponding path program 1 times [2022-02-20 18:52:09,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:09,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877039554] [2022-02-20 18:52:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:09,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {26482#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {26484#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:09,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {26484#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {26485#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {26486#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {26486#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {26486#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:09,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {26486#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:09,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {26487#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {26488#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {26488#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {26488#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {26488#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {26488#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {26488#(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; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,987 INFO L290 TraceCheckUtils]: 53: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 != ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 > ~id3~0;~send3~0 := main_~node3__m3~5#1; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} ~mode3~0 := 0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {26489#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:09,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {26489#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {26490#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~8#1|))} is VALID [2022-02-20 18:52:09,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {26490#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~8#1|))} assume !(main_~node4__m4~8#1 != ~nomsg~0);~mode4~0 := 0; {26483#false} is VALID [2022-02-20 18:52:09,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {26483#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~14#1; {26483#false} is VALID [2022-02-20 18:52:09,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {26483#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~14#1 := 0;~__return_4143~0 := main_~check__tmp~14#1;main_~main__c1~0#1 := ~__return_4143~0;havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~12#1;main_~assert__arg~12#1 := main_~__tmp_13~0#1; {26483#false} is VALID [2022-02-20 18:52:09,989 INFO L290 TraceCheckUtils]: 63: Hoare triple {26483#false} assume 0 == main_~assert__arg~12#1 % 256; {26483#false} is VALID [2022-02-20 18:52:09,989 INFO L290 TraceCheckUtils]: 64: Hoare triple {26483#false} assume !false; {26483#false} is VALID [2022-02-20 18:52:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:09,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:09,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877039554] [2022-02-20 18:52:09,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877039554] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:09,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:09,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:09,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238665620] [2022-02-20 18:52:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:09,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:09,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:10,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:10,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:10,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:10,048 INFO L87 Difference]: Start difference. First operand 339 states and 442 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:13,922 INFO L93 Difference]: Finished difference Result 751 states and 1019 transitions. [2022-02-20 18:52:13,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:13,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 628 transitions. [2022-02-20 18:52:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 628 transitions. [2022-02-20 18:52:13,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 628 transitions. [2022-02-20 18:52:14,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:14,348 INFO L225 Difference]: With dead ends: 751 [2022-02-20 18:52:14,348 INFO L226 Difference]: Without dead ends: 746 [2022-02-20 18:52:14,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:14,349 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 849 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:14,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 1118 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-02-20 18:52:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 339. [2022-02-20 18:52:15,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:15,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.3445121951219512) internal successors, (441), 338 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,143 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.3445121951219512) internal successors, (441), 338 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,143 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.3445121951219512) internal successors, (441), 338 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:15,159 INFO L93 Difference]: Finished difference Result 746 states and 1013 transitions. [2022-02-20 18:52:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1013 transitions. [2022-02-20 18:52:15,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:15,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:15,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.3445121951219512) internal successors, (441), 338 states have internal predecessors, (441), 0 states have call successors, (0), 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 746 states. [2022-02-20 18:52:15,161 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.3445121951219512) internal successors, (441), 338 states have internal predecessors, (441), 0 states have call successors, (0), 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 746 states. [2022-02-20 18:52:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:15,177 INFO L93 Difference]: Finished difference Result 746 states and 1013 transitions. [2022-02-20 18:52:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1013 transitions. [2022-02-20 18:52:15,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:15,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:15,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:15,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3445121951219512) internal successors, (441), 338 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 441 transitions. [2022-02-20 18:52:15,183 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 441 transitions. Word has length 65 [2022-02-20 18:52:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:15,183 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 441 transitions. [2022-02-20 18:52:15,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,184 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 441 transitions. [2022-02-20 18:52:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:15,184 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:15,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:15,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:15,185 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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:15,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:15,185 INFO L85 PathProgramCache]: Analyzing trace with hash -636059456, now seen corresponding path program 1 times [2022-02-20 18:52:15,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:15,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249290902] [2022-02-20 18:52:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:15,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:15,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {29426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {29428#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:15,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {29428#(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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {29429#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {29429#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {29429#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {29429#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {29430#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {29430#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {29430#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {29430#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:15,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {29431#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {29432#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:15,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {29432#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {29432#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:15,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {29432#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {29432#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:15,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {29432#(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; {29432#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:15,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {29432#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {29432#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:15,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {29432#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {29432#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:15,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {29432#(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; {29432#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:15,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {29432#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {29432#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:15,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {29432#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {29432#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:15,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {29432#(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; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 4); {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,343 INFO L290 TraceCheckUtils]: 46: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,343 INFO L290 TraceCheckUtils]: 47: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,343 INFO L290 TraceCheckUtils]: 48: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,344 INFO L290 TraceCheckUtils]: 50: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {29433#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:15,344 INFO L290 TraceCheckUtils]: 51: Hoare triple {29433#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {29434#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:52:15,344 INFO L290 TraceCheckUtils]: 52: Hoare triple {29434#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {29427#false} is VALID [2022-02-20 18:52:15,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {29427#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {29427#false} is VALID [2022-02-20 18:52:15,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {29427#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29427#false} is VALID [2022-02-20 18:52:15,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {29427#false} assume main_~node3__m3~1#1 != ~nomsg~0; {29427#false} is VALID [2022-02-20 18:52:15,344 INFO L290 TraceCheckUtils]: 56: Hoare triple {29427#false} assume !(main_~node3__m3~1#1 > ~id3~0); {29427#false} is VALID [2022-02-20 18:52:15,345 INFO L290 TraceCheckUtils]: 57: Hoare triple {29427#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {29427#false} is VALID [2022-02-20 18:52:15,345 INFO L290 TraceCheckUtils]: 58: Hoare triple {29427#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29427#false} is VALID [2022-02-20 18:52:15,345 INFO L290 TraceCheckUtils]: 59: Hoare triple {29427#false} assume main_~node4__m4~3#1 != ~nomsg~0; {29427#false} is VALID [2022-02-20 18:52:15,345 INFO L290 TraceCheckUtils]: 60: Hoare triple {29427#false} assume !(main_~node4__m4~3#1 > ~id4~0); {29427#false} is VALID [2022-02-20 18:52:15,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {29427#false} assume main_~node4__m4~3#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~5#1; {29427#false} is VALID [2022-02-20 18:52:15,345 INFO L290 TraceCheckUtils]: 62: Hoare triple {29427#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~5#1 := 0;~__return_3835~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_3835~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {29427#false} is VALID [2022-02-20 18:52:15,345 INFO L290 TraceCheckUtils]: 63: Hoare triple {29427#false} assume 0 == main_~assert__arg~5#1 % 256; {29427#false} is VALID [2022-02-20 18:52:15,345 INFO L290 TraceCheckUtils]: 64: Hoare triple {29427#false} assume !false; {29427#false} is VALID [2022-02-20 18:52:15,345 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:15,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:15,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249290902] [2022-02-20 18:52:15,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249290902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:15,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:15,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:15,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343515887] [2022-02-20 18:52:15,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:15,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:15,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:15,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:15,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:15,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:15,389 INFO L87 Difference]: Start difference. First operand 339 states and 441 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,174 INFO L93 Difference]: Finished difference Result 786 states and 1086 transitions. [2022-02-20 18:52:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 18:52:19,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 757 transitions. [2022-02-20 18:52:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 757 transitions. [2022-02-20 18:52:19,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 757 transitions. [2022-02-20 18:52:19,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 757 edges. 757 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,656 INFO L225 Difference]: With dead ends: 786 [2022-02-20 18:52:19,656 INFO L226 Difference]: Without dead ends: 616 [2022-02-20 18:52:19,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:52:19,657 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 1204 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:19,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1204 Valid, 1323 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-02-20 18:52:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 339. [2022-02-20 18:52:20,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:20,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 339 states, 328 states have (on average 1.3384146341463414) internal successors, (439), 338 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,448 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 339 states, 328 states have (on average 1.3384146341463414) internal successors, (439), 338 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,448 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 339 states, 328 states have (on average 1.3384146341463414) internal successors, (439), 338 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:20,459 INFO L93 Difference]: Finished difference Result 616 states and 845 transitions. [2022-02-20 18:52:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 845 transitions. [2022-02-20 18:52:20,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:20,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:20,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.3384146341463414) internal successors, (439), 338 states have internal predecessors, (439), 0 states have call successors, (0), 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 616 states. [2022-02-20 18:52:20,460 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.3384146341463414) internal successors, (439), 338 states have internal predecessors, (439), 0 states have call successors, (0), 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 616 states. [2022-02-20 18:52:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:20,472 INFO L93 Difference]: Finished difference Result 616 states and 845 transitions. [2022-02-20 18:52:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 845 transitions. [2022-02-20 18:52:20,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:20,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:20,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:20,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3384146341463414) internal successors, (439), 338 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 439 transitions. [2022-02-20 18:52:20,478 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 439 transitions. Word has length 65 [2022-02-20 18:52:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:20,478 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 439 transitions. [2022-02-20 18:52:20,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 439 transitions. [2022-02-20 18:52:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:20,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:20,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:20,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:52:20,479 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:20,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2058271748, now seen corresponding path program 1 times [2022-02-20 18:52:20,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:20,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75607708] [2022-02-20 18:52:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:20,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {32163#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {32165#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:20,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {32165#(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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {32166#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {32167#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {32167#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {32167#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:20,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {32167#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode3~0 % 256; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id4~0 >= 0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~st4~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send4~0 == ~id4~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode4~0 % 256; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id2~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id3~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id4~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id3~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id4~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send1~0 != ~nomsg~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send2~0 != ~nomsg~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send3~0 != ~nomsg~0; {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:20,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {32168#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {32169#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {32169#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {32169#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {32169#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {32169#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {32169#(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; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} ~mode1~0 := 0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~3#1 != ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~3#1 > ~id3~0); {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~5#1;main_~node4__m4~5#1 := ~nomsg~0; {32170#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:20,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {32170#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {32171#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~5#1|))} is VALID [2022-02-20 18:52:20,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {32171#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~5#1|))} assume !(main_~node4__m4~5#1 != ~nomsg~0);~mode4~0 := 0; {32164#false} is VALID [2022-02-20 18:52:20,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {32164#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~8#1; {32164#false} is VALID [2022-02-20 18:52:20,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {32164#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~8#1 := 0;~__return_4410~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_4410~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; {32164#false} is VALID [2022-02-20 18:52:20,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {32164#false} assume 0 == main_~assert__arg~8#1 % 256; {32164#false} is VALID [2022-02-20 18:52:20,602 INFO L290 TraceCheckUtils]: 64: Hoare triple {32164#false} assume !false; {32164#false} is VALID [2022-02-20 18:52:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:20,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:20,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75607708] [2022-02-20 18:52:20,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75607708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:20,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:20,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:20,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254601904] [2022-02-20 18:52:20,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:20,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:20,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:20,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:20,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:20,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:20,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:20,651 INFO L87 Difference]: Start difference. First operand 339 states and 439 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:24,983 INFO L93 Difference]: Finished difference Result 751 states and 1015 transitions. [2022-02-20 18:52:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:24,983 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 625 transitions. [2022-02-20 18:52:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 625 transitions. [2022-02-20 18:52:24,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 625 transitions. [2022-02-20 18:52:25,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:25,431 INFO L225 Difference]: With dead ends: 751 [2022-02-20 18:52:25,431 INFO L226 Difference]: Without dead ends: 746 [2022-02-20 18:52:25,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:25,432 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1513 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:25,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1513 Valid, 1124 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:25,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-02-20 18:52:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 339. [2022-02-20 18:52:26,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:26,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.3323170731707317) internal successors, (437), 338 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,281 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.3323170731707317) internal successors, (437), 338 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,282 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 339 states, 328 states have (on average 1.3323170731707317) internal successors, (437), 338 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,297 INFO L93 Difference]: Finished difference Result 746 states and 1009 transitions. [2022-02-20 18:52:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1009 transitions. [2022-02-20 18:52:26,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.3323170731707317) internal successors, (437), 338 states have internal predecessors, (437), 0 states have call successors, (0), 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 746 states. [2022-02-20 18:52:26,298 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.3323170731707317) internal successors, (437), 338 states have internal predecessors, (437), 0 states have call successors, (0), 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 746 states. [2022-02-20 18:52:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,313 INFO L93 Difference]: Finished difference Result 746 states and 1009 transitions. [2022-02-20 18:52:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1009 transitions. [2022-02-20 18:52:26,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:26,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3323170731707317) internal successors, (437), 338 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 437 transitions. [2022-02-20 18:52:26,319 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 437 transitions. Word has length 65 [2022-02-20 18:52:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:26,320 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 437 transitions. [2022-02-20 18:52:26,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 437 transitions. [2022-02-20 18:52:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:26,320 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:26,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:26,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:52:26,321 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:26,321 INFO L85 PathProgramCache]: Analyzing trace with hash -324498446, now seen corresponding path program 1 times [2022-02-20 18:52:26,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:26,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910140619] [2022-02-20 18:52:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:26,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:26,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {35109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {35111#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:26,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {35111#(<= (+ ~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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {35112#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {35113#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {35113#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {35113#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:26,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {35113#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {35114#(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; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {35114#(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; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {35114#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:26,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {35114#(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; {35115#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {35115#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {35115#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {35115#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {35115#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {35115#(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; {35115#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {35115#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {35115#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {35115#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {35115#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:26,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {35115#(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; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,427 INFO L290 TraceCheckUtils]: 47: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,428 INFO L290 TraceCheckUtils]: 52: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {35116#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:26,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {35116#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {35117#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:52:26,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {35117#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} assume !(main_~node3__m3~3#1 != ~nomsg~0);~mode3~0 := 0; {35110#false} is VALID [2022-02-20 18:52:26,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {35110#false} havoc main_~node4__m4~4#1;main_~node4__m4~4#1 := ~nomsg~0; {35110#false} is VALID [2022-02-20 18:52:26,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {35110#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~4#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {35110#false} is VALID [2022-02-20 18:52:26,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {35110#false} assume main_~node4__m4~4#1 != ~nomsg~0; {35110#false} is VALID [2022-02-20 18:52:26,430 INFO L290 TraceCheckUtils]: 60: Hoare triple {35110#false} assume !(main_~node4__m4~4#1 > ~id4~0); {35110#false} is VALID [2022-02-20 18:52:26,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {35110#false} assume main_~node4__m4~4#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~7#1; {35110#false} is VALID [2022-02-20 18:52:26,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {35110#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_4230~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_4230~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; {35110#false} is VALID [2022-02-20 18:52:26,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {35110#false} assume 0 == main_~assert__arg~7#1 % 256; {35110#false} is VALID [2022-02-20 18:52:26,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {35110#false} assume !false; {35110#false} is VALID [2022-02-20 18:52:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:26,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:26,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910140619] [2022-02-20 18:52:26,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910140619] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:26,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:26,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:26,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493759378] [2022-02-20 18:52:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:26,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:26,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:26,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:26,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:26,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:26,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:26,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:26,471 INFO L87 Difference]: Start difference. First operand 339 states and 437 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,463 INFO L93 Difference]: Finished difference Result 783 states and 1061 transitions. [2022-02-20 18:52:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 653 transitions. [2022-02-20 18:52:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 653 transitions. [2022-02-20 18:52:30,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 653 transitions. [2022-02-20 18:52:30,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 653 edges. 653 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:30,888 INFO L225 Difference]: With dead ends: 783 [2022-02-20 18:52:30,888 INFO L226 Difference]: Without dead ends: 766 [2022-02-20 18:52:30,889 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:30,889 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 825 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:30,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 1295 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-02-20 18:52:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 339. [2022-02-20 18:52:31,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:31,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 766 states. Second operand has 339 states, 328 states have (on average 1.326219512195122) internal successors, (435), 338 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,728 INFO L74 IsIncluded]: Start isIncluded. First operand 766 states. Second operand has 339 states, 328 states have (on average 1.326219512195122) internal successors, (435), 338 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,729 INFO L87 Difference]: Start difference. First operand 766 states. Second operand has 339 states, 328 states have (on average 1.326219512195122) internal successors, (435), 338 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,745 INFO L93 Difference]: Finished difference Result 766 states and 1041 transitions. [2022-02-20 18:52:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1041 transitions. [2022-02-20 18:52:31,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 328 states have (on average 1.326219512195122) internal successors, (435), 338 states have internal predecessors, (435), 0 states have call successors, (0), 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 766 states. [2022-02-20 18:52:31,746 INFO L87 Difference]: Start difference. First operand has 339 states, 328 states have (on average 1.326219512195122) internal successors, (435), 338 states have internal predecessors, (435), 0 states have call successors, (0), 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 766 states. [2022-02-20 18:52:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,762 INFO L93 Difference]: Finished difference Result 766 states and 1041 transitions. [2022-02-20 18:52:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1041 transitions. [2022-02-20 18:52:31,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:31,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.326219512195122) internal successors, (435), 338 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 435 transitions. [2022-02-20 18:52:31,768 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 435 transitions. Word has length 65 [2022-02-20 18:52:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:31,768 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 435 transitions. [2022-02-20 18:52:31,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 435 transitions. [2022-02-20 18:52:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:52:31,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:31,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:31,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:52:31,769 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash -809481061, now seen corresponding path program 1 times [2022-02-20 18:52:31,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:31,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233245439] [2022-02-20 18:52:31,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:32,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {38129#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2937~0 := 0;~__return_4605~0 := 0;~__tmp_3038_0~0 := 0;~__return_3109~0 := 0;~__tmp_3118_0~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__tmp_3196_0~0 := 0;~__tmp_3202_0~0 := 0;~__return_3122~0 := 0;~__return_3470~0 := 0;~__return_3661~0 := 0;~__return_3835~0 := 0;~__return_4046~0 := 0;~__return_4230~0 := 0;~__return_4410~0 := 0;~__return_4576~0 := 0;~__return_3380~0 := 0;~__return_3543~0 := 0;~__return_3746~0 := 0;~__return_3910~0 := 0;~__return_4143~0 := 0;~__return_4303~0 := 0;~__return_4495~0 := 0;~__return_4538~0 := 0;~__return_4445~0 := 0;~__return_4360~0 := 0;~__return_4265~0 := 0;~__return_4192~0 := 0;~__return_4081~0 := 0;~__return_3981~0 := 0;~__return_3872~0 := 0;~__return_3797~0 := 0;~__return_3696~0 := 0;~__return_3608~0 := 0;~__return_3505~0 := 0;~__return_3429~0 := 0;~__return_3302~0 := 0;~__return_3028~0 := 0; {38129#true} is VALID [2022-02-20 18:52:32,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {38129#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_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;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; {38131#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:32,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {38131#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume 0 == ~r1~0; {38131#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:32,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {38131#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume ~id1~0 >= 0; {38132#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:32,042 INFO L290 TraceCheckUtils]: 4: Hoare triple {38132#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume 0 == ~st1~0; {38132#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:32,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {38132#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume ~send1~0 == ~id1~0; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode1~0 % 256; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id2~0 >= 0; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~st2~0; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~send2~0 == ~id2~0; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode2~0 % 256; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id3~0 >= 0; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~st3~0; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~send3~0 == ~id3~0; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode3~0 % 256; {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:32,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {38133#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id4~0 >= 0; {38134#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} is VALID [2022-02-20 18:52:32,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {38134#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} assume 0 == ~st4~0; {38134#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} is VALID [2022-02-20 18:52:32,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {38134#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} assume ~send4~0 == ~id4~0; {38135#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {38135#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume 0 == ~mode4~0 % 256; {38135#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {38135#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id1~0 != ~id2~0; {38135#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {38135#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id1~0 != ~id3~0; {38135#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {38135#(and (<= 0 ~id1~0) (or (<= ~id4~0 ~send4~0) (< ~id4~0 (+ ~id1~0 1))) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id1~0 != ~id4~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id2~0 != ~id3~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id2~0 != ~id4~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~send1~0 != ~nomsg~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~send2~0 != ~nomsg~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~send3~0 != ~nomsg~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~send4~0 != ~nomsg~0; {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} is VALID [2022-02-20 18:52:32,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {38136#(and (or (not (<= ~id1~0 ~id4~0)) (and (<= ~id4~0 ~send4~0) (<= (+ ~id1~0 1) ~id4~0))) (<= 0 ~id1~0) (or (<= ~id1~0 ~id4~0) (<= ~send4~0 ~id4~0)) (<= ~send4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send4~0 127)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:32,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:32,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume !(~r1~0 >= 4); {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:32,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:32,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4605~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4605~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; {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:32,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3038_0~0 := main_~main____CPAchecker_TMP_0~0#1; {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:32,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3038_0~0; {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:32,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} is VALID [2022-02-20 18:52:32,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {38137#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38138#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= (+ ~id1~0 1) ~id4~0) (<= ~id4~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:32,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {38138#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= (+ ~id1~0 1) ~id4~0) (<= ~id4~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} assume main_~node1__m1~1#1 != ~nomsg~0; {38138#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= (+ ~id1~0 1) ~id4~0) (<= ~id4~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:32,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {38138#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= (+ ~id1~0 1) ~id4~0) (<= ~id4~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 > ~id1~0); {38139#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:52:32,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {38139#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {38130#false} is VALID [2022-02-20 18:52:32,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {38130#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {38130#false} is VALID [2022-02-20 18:52:32,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {38130#false} assume main_~node2__m2~3#1 != ~nomsg~0; {38130#false} is VALID [2022-02-20 18:52:32,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {38130#false} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {38130#false} is VALID [2022-02-20 18:52:32,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {38130#false} ~mode2~0 := 0; {38130#false} is VALID [2022-02-20 18:52:32,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {38130#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {38130#false} is VALID [2022-02-20 18:52:32,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {38130#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {38130#false} is VALID [2022-02-20 18:52:32,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {38130#false} assume main_~node3__m3~4#1 != ~nomsg~0; {38130#false} is VALID [2022-02-20 18:52:32,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {38130#false} assume main_~node3__m3~4#1 > ~id3~0;~send3~0 := main_~node3__m3~4#1; {38130#false} is VALID [2022-02-20 18:52:32,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {38130#false} ~mode3~0 := 0; {38130#false} is VALID [2022-02-20 18:52:32,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {38130#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {38130#false} is VALID [2022-02-20 18:52:32,065 INFO L290 TraceCheckUtils]: 60: Hoare triple {38130#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {38130#false} is VALID [2022-02-20 18:52:32,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {38130#false} assume main_~node4__m4~6#1 != ~nomsg~0; {38130#false} is VALID [2022-02-20 18:52:32,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {38130#false} assume !(main_~node4__m4~6#1 > ~id4~0); {38130#false} is VALID [2022-02-20 18:52:32,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {38130#false} assume main_~node4__m4~6#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; {38130#false} is VALID [2022-02-20 18:52:32,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {38130#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_3543~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_3543~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; {38130#false} is VALID [2022-02-20 18:52:32,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {38130#false} assume 0 == main_~assert__arg~10#1 % 256; {38130#false} is VALID [2022-02-20 18:52:32,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {38130#false} assume !false; {38130#false} is VALID [2022-02-20 18:52:32,066 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:32,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:32,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233245439] [2022-02-20 18:52:32,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233245439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:32,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:32,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:52:32,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864042360] [2022-02-20 18:52:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:32,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:52:32,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:32,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:32,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:32,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:52:32,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:32,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:52:32,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:32,116 INFO L87 Difference]: Start difference. First operand 339 states and 435 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)