./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.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.UNBOUNDED.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 a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:51:43,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:51:43,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:51:43,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:51:43,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:51:43,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:51:43,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:51:43,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:51:43,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:51:43,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:51:43,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:51:43,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:51:43,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:51:43,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:51:43,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:51:43,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:51:43,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:51:43,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:51:43,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:51:43,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:51:43,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:51:43,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:51:43,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:51:43,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:51:43,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:51:43,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:51:43,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:51:43,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:51:43,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:51:43,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:51:43,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:51:43,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:51:43,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:51:43,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:51:43,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:51:43,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:51:43,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:51:43,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:51:43,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:51:43,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:51:43,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:51:43,673 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:43,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:51:43,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:51:43,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:51:43,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:51:43,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:51:43,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:51:43,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:51:43,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:51:43,698 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:51:43,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:51:43,699 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:51:43,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:51:43,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:51:43,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:51:43,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:51:43,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:51:43,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:51:43,700 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:51:43,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:51:43,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:51:43,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:51:43,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:51:43,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:51:43,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:51:43,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:43,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:51:43,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:51:43,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:51:43,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:51:43,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:51:43,702 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:51:43,702 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:51:43,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:51:43,703 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 -> a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b [2022-02-20 18:51:43,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:51:43,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:51:43,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:51:43,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:51:43,899 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:51:43,900 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:51:43,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30069268a/438d72661c5b4974a050b9dc74fb6cdc/FLAGd231f85e2 [2022-02-20 18:51:44,393 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:51:44,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:51:44,416 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30069268a/438d72661c5b4974a050b9dc74fb6cdc/FLAGd231f85e2 [2022-02-20 18:51:44,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30069268a/438d72661c5b4974a050b9dc74fb6cdc [2022-02-20 18:51:44,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:51:44,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:51:44,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:44,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:51:44,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:51:44,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:44" (1/1) ... [2022-02-20 18:51:44,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661a943d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:44, skipping insertion in model container [2022-02-20 18:51:44,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:44" (1/1) ... [2022-02-20 18:51:44,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:51:44,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:51:45,128 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.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2022-02-20 18:51:45,143 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.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2022-02-20 18:51:45,149 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2022-02-20 18:51:45,152 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2022-02-20 18:51:45,163 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.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2022-02-20 18:51:45,166 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.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2022-02-20 18:51:45,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2022-02-20 18:51:45,191 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.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2022-02-20 18:51:45,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2022-02-20 18:51:45,198 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.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2022-02-20 18:51:45,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.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2022-02-20 18:51:45,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:45,316 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:51:45,353 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.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2022-02-20 18:51:45,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2022-02-20 18:51:45,385 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2022-02-20 18:51:45,403 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2022-02-20 18:51:45,407 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.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2022-02-20 18:51:45,408 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.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2022-02-20 18:51:45,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2022-02-20 18:51:45,415 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.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2022-02-20 18:51:45,417 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.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2022-02-20 18:51:45,420 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.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2022-02-20 18:51:45,424 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.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2022-02-20 18:51:45,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:45,464 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:51:45,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:45 WrapperNode [2022-02-20 18:51:45,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:45,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:45,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:51:45,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:51:45,470 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:45" (1/1) ... [2022-02-20 18:51:45,484 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:45" (1/1) ... [2022-02-20 18:51:45,528 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1790 [2022-02-20 18:51:45,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:45,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:51:45,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:51:45,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:51:45,542 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:45" (1/1) ... [2022-02-20 18:51:45,542 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:45" (1/1) ... [2022-02-20 18:51:45,545 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:45" (1/1) ... [2022-02-20 18:51:45,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:45" (1/1) ... [2022-02-20 18:51:45,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:45" (1/1) ... [2022-02-20 18:51:45,566 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:45" (1/1) ... [2022-02-20 18:51:45,582 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:45" (1/1) ... [2022-02-20 18:51:45,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:51:45,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:51:45,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:51:45,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:51:45,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:45" (1/1) ... [2022-02-20 18:51:45,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:45,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:51:45,624 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:45,646 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:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:51:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:51:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:51:45,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:51:45,777 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:51:45,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:51:46,797 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:51:46,804 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:51:46,804 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:51:46,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:46 BoogieIcfgContainer [2022-02-20 18:51:46,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:51:46,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:51:46,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:51:46,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:51:46,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:51:44" (1/3) ... [2022-02-20 18:51:46,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b741d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:46, skipping insertion in model container [2022-02-20 18:51:46,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:45" (2/3) ... [2022-02-20 18:51:46,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b741d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:46, skipping insertion in model container [2022-02-20 18:51:46,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:46" (3/3) ... [2022-02-20 18:51:46,811 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:51:46,814 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:51:46,814 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-20 18:51:46,844 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:51:46,848 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:46,848 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-20 18:51:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call 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,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:51:46,897 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:46,897 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] [2022-02-20 18:51:46,898 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:46,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:46,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1863160701, now seen corresponding path program 1 times [2022-02-20 18:51:46,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:46,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804439207] [2022-02-20 18:51:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:47,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {362#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {362#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {362#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:47,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {363#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:47,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {363#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {363#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:47,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:47,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {364#(<= (+ ~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; {361#false} is VALID [2022-02-20 18:51:47,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {361#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~2#1; {361#false} is VALID [2022-02-20 18:51:47,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:51:47,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {361#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {361#false} is VALID [2022-02-20 18:51:47,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:51:47,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {361#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~8#1; {361#false} is VALID [2022-02-20 18:51:47,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:51:47,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {361#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {361#false} is VALID [2022-02-20 18:51:47,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {361#false} assume !(~r1~0 % 256 >= 4); {361#false} is VALID [2022-02-20 18:51:47,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {361#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {361#false} is VALID [2022-02-20 18:51:47,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {361#false} assume ~r1~0 % 256 < 4;main_~check__tmp~31#1 := 1;~__return_2995~0 := main_~check__tmp~31#1;main_~main__c1~0#1 := ~__return_2995~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; {361#false} is VALID [2022-02-20 18:51:47,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {361#false} assume !(0 == main_~assert__arg~27#1 % 256); {361#false} is VALID [2022-02-20 18:51:47,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {361#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:51:47,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {361#false} assume !(0 == ~mode1~0 % 256); {361#false} is VALID [2022-02-20 18:51:47,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {361#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:51:47,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {361#false} assume main_~node1__m1~1#1 != ~nomsg~0; {361#false} is VALID [2022-02-20 18:51:47,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {361#false} assume !(main_~node1__m1~1#1 > ~id1~0); {361#false} is VALID [2022-02-20 18:51:47,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:51:47,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {361#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:51:47,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {361#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {361#false} is VALID [2022-02-20 18:51:47,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {361#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:51:47,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {361#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:51:47,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {361#false} assume main_~node3__m3~4#1 != ~nomsg~0; {361#false} is VALID [2022-02-20 18:51:47,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {361#false} assume !(main_~node3__m3~4#1 > ~id3~0); {361#false} is VALID [2022-02-20 18:51:47,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:51:47,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {361#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:51:47,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {361#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {361#false} is VALID [2022-02-20 18:51:47,241 INFO L290 TraceCheckUtils]: 54: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:51:47,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {361#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3692~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3692~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; {361#false} is VALID [2022-02-20 18:51:47,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {361#false} assume 0 == main_~assert__arg~11#1 % 256; {361#false} is VALID [2022-02-20 18:51:47,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 18:51:47,243 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:47,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:47,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804439207] [2022-02-20 18:51:47,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804439207] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:47,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:47,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:47,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215708623] [2022-02-20 18:51:47,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:47,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:51:47,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:47,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:47,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:47,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:47,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:47,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:47,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:47,309 INFO L87 Difference]: Start difference. First operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 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.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:48,504 INFO L93 Difference]: Finished difference Result 703 states and 1189 transitions. [2022-02-20 18:51:48,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:48,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:51:48,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1189 transitions. [2022-02-20 18:51:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1189 transitions. [2022-02-20 18:51:48,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1189 transitions. [2022-02-20 18:51:49,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1189 edges. 1189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:49,332 INFO L225 Difference]: With dead ends: 703 [2022-02-20 18:51:49,332 INFO L226 Difference]: Without dead ends: 427 [2022-02-20 18:51:49,335 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:49,338 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 1864 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:49,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1864 Valid, 499 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-02-20 18:51:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 385. [2022-02-20 18:51:49,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:49,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 385 states, 374 states have (on average 1.36096256684492) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:49,476 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 385 states, 374 states have (on average 1.36096256684492) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:49,476 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 385 states, 374 states have (on average 1.36096256684492) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:49,489 INFO L93 Difference]: Finished difference Result 427 states and 547 transitions. [2022-02-20 18:51:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 547 transitions. [2022-02-20 18:51:49,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:49,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:49,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 374 states have (on average 1.36096256684492) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 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 427 states. [2022-02-20 18:51:49,492 INFO L87 Difference]: Start difference. First operand has 385 states, 374 states have (on average 1.36096256684492) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 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 427 states. [2022-02-20 18:51:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:49,504 INFO L93 Difference]: Finished difference Result 427 states and 547 transitions. [2022-02-20 18:51:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 547 transitions. [2022-02-20 18:51:49,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:49,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:49,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:49,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 374 states have (on average 1.36096256684492) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2022-02-20 18:51:49,518 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 58 [2022-02-20 18:51:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:49,518 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2022-02-20 18:51:49,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2022-02-20 18:51:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:51:49,520 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:49,520 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:49,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:51:49,520 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:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1094505509, now seen corresponding path program 1 times [2022-02-20 18:51:49,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:49,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504676316] [2022-02-20 18:51:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:49,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:49,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {2544#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {2546#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:49,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {2546#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {2547#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:51:49,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {2547#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {2547#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:51:49,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {2547#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#(<= (+ ~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; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#(<= (+ ~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; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {2548#(<= (+ ~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; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {2548#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:51:49,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#(<= (+ ~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; {2545#false} is VALID [2022-02-20 18:51:49,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {2545#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2545#false} is VALID [2022-02-20 18:51:49,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {2545#false} assume !(~r1~0 % 256 >= 4); {2545#false} is VALID [2022-02-20 18:51:49,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {2545#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {2545#false} is VALID [2022-02-20 18:51:49,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {2545#false} assume ~r1~0 % 256 < 4;main_~check__tmp~23#1 := 1;~__return_3921~0 := main_~check__tmp~23#1;main_~main__c1~0#1 := ~__return_3921~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; {2545#false} is VALID [2022-02-20 18:51:49,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {2545#false} assume !(0 == main_~assert__arg~19#1 % 256); {2545#false} is VALID [2022-02-20 18:51:49,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {2545#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2545#false} is VALID [2022-02-20 18:51:49,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {2545#false} assume !(0 == ~mode1~0 % 256); {2545#false} is VALID [2022-02-20 18:51:49,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {2545#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2545#false} is VALID [2022-02-20 18:51:49,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {2545#false} assume main_~node1__m1~1#1 != ~nomsg~0; {2545#false} is VALID [2022-02-20 18:51:49,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {2545#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2545#false} is VALID [2022-02-20 18:51:49,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {2545#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; {2545#false} is VALID [2022-02-20 18:51:49,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {2545#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2545#false} is VALID [2022-02-20 18:51:49,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {2545#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {2545#false} is VALID [2022-02-20 18:51:49,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {2545#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {2545#false} is VALID [2022-02-20 18:51:49,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {2545#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2545#false} is VALID [2022-02-20 18:51:49,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {2545#false} assume main_~node3__m3~4#1 != ~nomsg~0; {2545#false} is VALID [2022-02-20 18:51:49,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {2545#false} assume !(main_~node3__m3~4#1 > ~id3~0); {2545#false} is VALID [2022-02-20 18:51:49,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {2545#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; {2545#false} is VALID [2022-02-20 18:51:49,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {2545#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2545#false} is VALID [2022-02-20 18:51:49,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {2545#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {2545#false} is VALID [2022-02-20 18:51:49,642 INFO L290 TraceCheckUtils]: 55: Hoare triple {2545#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; {2545#false} is VALID [2022-02-20 18:51:49,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {2545#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3692~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3692~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; {2545#false} is VALID [2022-02-20 18:51:49,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {2545#false} assume 0 == main_~assert__arg~11#1 % 256; {2545#false} is VALID [2022-02-20 18:51:49,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2022-02-20 18:51:49,653 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:49,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:49,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504676316] [2022-02-20 18:51:49,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504676316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:49,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:49,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:49,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219190813] [2022-02-20 18:51:49,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:49,655 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:49,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:49,655 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:49,686 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:49,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:49,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:49,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:49,687 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:50,380 INFO L93 Difference]: Finished difference Result 680 states and 921 transitions. [2022-02-20 18:51:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:50,380 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:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:50,381 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:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2022-02-20 18:51:50,384 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:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2022-02-20 18:51:50,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 639 transitions. [2022-02-20 18:51:50,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 639 edges. 639 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:50,782 INFO L225 Difference]: With dead ends: 680 [2022-02-20 18:51:50,783 INFO L226 Difference]: Without dead ends: 365 [2022-02-20 18:51:50,783 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:50,784 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 936 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:50,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 211 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-02-20 18:51:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-02-20 18:51:50,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:50,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 365 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 364 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call 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,989 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 365 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 364 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call 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,989 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 365 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 364 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call 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,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:50,996 INFO L93 Difference]: Finished difference Result 365 states and 483 transitions. [2022-02-20 18:51:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 483 transitions. [2022-02-20 18:51:50,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:50,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:50,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 364 states have internal predecessors, (483), 0 states have call successors, (0), 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 365 states. [2022-02-20 18:51:50,998 INFO L87 Difference]: Start difference. First operand has 365 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 364 states have internal predecessors, (483), 0 states have call successors, (0), 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 365 states. [2022-02-20 18:51:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:51,005 INFO L93 Difference]: Finished difference Result 365 states and 483 transitions. [2022-02-20 18:51:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 483 transitions. [2022-02-20 18:51:51,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:51,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:51,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:51,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 364 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call 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,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 483 transitions. [2022-02-20 18:51:51,014 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 483 transitions. Word has length 59 [2022-02-20 18:51:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:51,014 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 483 transitions. [2022-02-20 18:51:51,014 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:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 483 transitions. [2022-02-20 18:51:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:51:51,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:51,027 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:51,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:51:51,027 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:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 568036411, now seen corresponding path program 1 times [2022-02-20 18:51:51,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:51,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647381229] [2022-02-20 18:51:51,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:51,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {4579#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {4581#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:51,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {4581#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {4581#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:51,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {4581#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {4581#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:51,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {4581#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {4581#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:51,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {4581#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {4581#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:51,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {4581#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {4581#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:51,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {4581#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {4581#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:51,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {4581#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {4582#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:51,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {4582#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {4582#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:51,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {4582#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {4583#(<= (+ ~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; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {4583#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4583#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:51,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {4583#(<= (+ ~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; {4580#false} is VALID [2022-02-20 18:51:51,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {4580#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {4580#false} is VALID [2022-02-20 18:51:51,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {4580#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; {4580#false} is VALID [2022-02-20 18:51:51,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {4580#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {4580#false} is VALID [2022-02-20 18:51:51,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {4580#false} assume ~send4~0 != ~nomsg~0; {4580#false} is VALID [2022-02-20 18:51:51,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {4580#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; {4580#false} is VALID [2022-02-20 18:51:51,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {4580#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {4580#false} is VALID [2022-02-20 18:51:51,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {4580#false} assume !(~r1~0 % 256 >= 4); {4580#false} is VALID [2022-02-20 18:51:51,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {4580#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {4580#false} is VALID [2022-02-20 18:51:51,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {4580#false} assume ~r1~0 % 256 < 4;main_~check__tmp~22#1 := 1;~__return_4018~0 := main_~check__tmp~22#1;main_~main__c1~0#1 := ~__return_4018~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; {4580#false} is VALID [2022-02-20 18:51:51,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {4580#false} assume !(0 == main_~assert__arg~18#1 % 256); {4580#false} is VALID [2022-02-20 18:51:51,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {4580#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4580#false} is VALID [2022-02-20 18:51:51,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {4580#false} assume !(0 == ~mode1~0 % 256); {4580#false} is VALID [2022-02-20 18:51:51,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {4580#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4580#false} is VALID [2022-02-20 18:51:51,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {4580#false} assume main_~node1__m1~1#1 != ~nomsg~0; {4580#false} is VALID [2022-02-20 18:51:51,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {4580#false} assume !(main_~node1__m1~1#1 > ~id1~0); {4580#false} is VALID [2022-02-20 18:51:51,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {4580#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; {4580#false} is VALID [2022-02-20 18:51:51,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {4580#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4580#false} is VALID [2022-02-20 18:51:51,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {4580#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {4580#false} is VALID [2022-02-20 18:51:51,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {4580#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {4580#false} is VALID [2022-02-20 18:51:51,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {4580#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4580#false} is VALID [2022-02-20 18:51:51,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {4580#false} assume main_~node3__m3~4#1 != ~nomsg~0; {4580#false} is VALID [2022-02-20 18:51:51,128 INFO L290 TraceCheckUtils]: 52: Hoare triple {4580#false} assume !(main_~node3__m3~4#1 > ~id3~0); {4580#false} is VALID [2022-02-20 18:51:51,128 INFO L290 TraceCheckUtils]: 53: Hoare triple {4580#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; {4580#false} is VALID [2022-02-20 18:51:51,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {4580#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4580#false} is VALID [2022-02-20 18:51:51,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {4580#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {4580#false} is VALID [2022-02-20 18:51:51,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {4580#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; {4580#false} is VALID [2022-02-20 18:51:51,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {4580#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3692~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3692~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; {4580#false} is VALID [2022-02-20 18:51:51,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {4580#false} assume 0 == main_~assert__arg~11#1 % 256; {4580#false} is VALID [2022-02-20 18:51:51,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {4580#false} assume !false; {4580#false} is VALID [2022-02-20 18:51:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:51,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:51,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647381229] [2022-02-20 18:51:51,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647381229] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:51,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:51,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:51,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188881969] [2022-02-20 18:51:51,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:51,135 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:51,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:51,136 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:51,169 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:51,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:51,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:51,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:51,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:51,170 INFO L87 Difference]: Start difference. First operand 365 states and 483 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:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:51,876 INFO L93 Difference]: Finished difference Result 660 states and 893 transitions. [2022-02-20 18:51:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:51,876 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:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:51,877 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:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-02-20 18:51:51,879 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:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-02-20 18:51:51,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 613 transitions. [2022-02-20 18:51:52,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:52,253 INFO L225 Difference]: With dead ends: 660 [2022-02-20 18:51:52,253 INFO L226 Difference]: Without dead ends: 346 [2022-02-20 18:51:52,253 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:52,254 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 908 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:52,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [908 Valid, 200 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-02-20 18:51:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-02-20 18:51:52,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:52,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand has 346 states, 335 states have (on average 1.373134328358209) internal successors, (460), 345 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call 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:52,523 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand has 346 states, 335 states have (on average 1.373134328358209) internal successors, (460), 345 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call 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:52,524 INFO L87 Difference]: Start difference. First operand 346 states. Second operand has 346 states, 335 states have (on average 1.373134328358209) internal successors, (460), 345 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call 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:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:52,529 INFO L93 Difference]: Finished difference Result 346 states and 460 transitions. [2022-02-20 18:51:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 460 transitions. [2022-02-20 18:51:52,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:52,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:52,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 335 states have (on average 1.373134328358209) internal successors, (460), 345 states have internal predecessors, (460), 0 states have call successors, (0), 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 346 states. [2022-02-20 18:51:52,531 INFO L87 Difference]: Start difference. First operand has 346 states, 335 states have (on average 1.373134328358209) internal successors, (460), 345 states have internal predecessors, (460), 0 states have call successors, (0), 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 346 states. [2022-02-20 18:51:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:52,536 INFO L93 Difference]: Finished difference Result 346 states and 460 transitions. [2022-02-20 18:51:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 460 transitions. [2022-02-20 18:51:52,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:52,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:52,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:52,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 335 states have (on average 1.373134328358209) internal successors, (460), 345 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call 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:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 460 transitions. [2022-02-20 18:51:52,544 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 460 transitions. Word has length 60 [2022-02-20 18:51:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:52,544 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 460 transitions. [2022-02-20 18:51:52,544 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:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 460 transitions. [2022-02-20 18:51:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:51:52,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:52,545 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:52,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:51:52,546 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:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash -715476529, now seen corresponding path program 1 times [2022-02-20 18:51:52,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:52,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195009370] [2022-02-20 18:51:52,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:52,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:52,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {6537#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {6539#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {6539#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:52,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {6539#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {6540#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:52,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {6540#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {6540#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:52,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {6540#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {6541#(<= (+ ~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; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {6541#(<= (+ ~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; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {6541#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6541#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {6541#(<= (+ ~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; {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {6538#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~2#1; {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {6538#false} assume ~send4~0 != ~nomsg~0; {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {6538#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; {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 37: Hoare triple {6538#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {6538#false} assume !(~r1~0 % 256 >= 4); {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {6538#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {6538#false} assume ~r1~0 % 256 < 4;main_~check__tmp~18#1 := 1;~__return_4370~0 := main_~check__tmp~18#1;main_~main__c1~0#1 := ~__return_4370~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; {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {6538#false} assume !(0 == main_~assert__arg~14#1 % 256); {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {6538#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6538#false} is VALID [2022-02-20 18:51:52,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {6538#false} assume !(0 == ~mode1~0 % 256); {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {6538#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {6538#false} assume main_~node1__m1~1#1 != ~nomsg~0; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {6538#false} assume !(main_~node1__m1~1#1 > ~id1~0); {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 47: Hoare triple {6538#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; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {6538#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {6538#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {6538#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 51: Hoare triple {6538#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {6538#false} assume main_~node3__m3~4#1 != ~nomsg~0; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {6538#false} assume !(main_~node3__m3~4#1 > ~id3~0); {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {6538#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; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {6538#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 56: Hoare triple {6538#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {6538#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; {6538#false} is VALID [2022-02-20 18:51:52,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {6538#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3692~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3692~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; {6538#false} is VALID [2022-02-20 18:51:52,651 INFO L290 TraceCheckUtils]: 59: Hoare triple {6538#false} assume 0 == main_~assert__arg~11#1 % 256; {6538#false} is VALID [2022-02-20 18:51:52,651 INFO L290 TraceCheckUtils]: 60: Hoare triple {6538#false} assume !false; {6538#false} is VALID [2022-02-20 18:51:52,651 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:52,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:52,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195009370] [2022-02-20 18:51:52,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195009370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:52,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:52,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:52,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362469583] [2022-02-20 18:51:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:52,654 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:52,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:52,655 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:52,690 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:52,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:52,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:52,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:52,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:52,690 INFO L87 Difference]: Start difference. First operand 346 states and 460 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:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:53,456 INFO L93 Difference]: Finished difference Result 641 states and 868 transitions. [2022-02-20 18:51:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:53,456 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:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:53,456 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:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-02-20 18:51:53,459 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:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-02-20 18:51:53,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-02-20 18:51:53,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:53,822 INFO L225 Difference]: With dead ends: 641 [2022-02-20 18:51:53,822 INFO L226 Difference]: Without dead ends: 338 [2022-02-20 18:51:53,822 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:53,825 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 861 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:53,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 196 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-02-20 18:51:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-02-20 18:51:54,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:54,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 338 states, 327 states have (on average 1.3730886850152906) internal successors, (449), 337 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call 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,167 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 338 states, 327 states have (on average 1.3730886850152906) internal successors, (449), 337 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call 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,167 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 338 states, 327 states have (on average 1.3730886850152906) internal successors, (449), 337 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call 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,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:54,173 INFO L93 Difference]: Finished difference Result 338 states and 449 transitions. [2022-02-20 18:51:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2022-02-20 18:51:54,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:54,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:54,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.3730886850152906) internal successors, (449), 337 states have internal predecessors, (449), 0 states have call successors, (0), 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 338 states. [2022-02-20 18:51:54,175 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.3730886850152906) internal successors, (449), 337 states have internal predecessors, (449), 0 states have call successors, (0), 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 338 states. [2022-02-20 18:51:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:54,185 INFO L93 Difference]: Finished difference Result 338 states and 449 transitions. [2022-02-20 18:51:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2022-02-20 18:51:54,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:54,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:54,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:54,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3730886850152906) internal successors, (449), 337 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call 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,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 449 transitions. [2022-02-20 18:51:54,192 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 449 transitions. Word has length 61 [2022-02-20 18:51:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:54,192 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 449 transitions. [2022-02-20 18:51:54,192 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:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2022-02-20 18:51:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:51:54,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:54,194 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:54,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:51:54,195 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:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash 207205371, now seen corresponding path program 1 times [2022-02-20 18:51:54,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:54,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424533574] [2022-02-20 18:51:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:54,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {8452#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {8454#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:54,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {8454#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {8455#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {8455#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {8455#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {8455#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {8456#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {8456#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {8456#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:54,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {8456#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:54,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {8457#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8458#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:54,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {8458#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8458#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:54,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {8458#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {8458#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:54,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {8458#(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; {8458#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:54,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {8458#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8458#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:54,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {8458#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {8458#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:54,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {8458#(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; {8458#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:54,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {8458#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {8458#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:54,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {8458#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {8458#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:54,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {8458#(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; {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 4); {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {8459#(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; {8459#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {8459#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8460#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {8460#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {8453#false} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {8453#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {8453#false} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {8453#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8453#false} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {8453#false} assume main_~node3__m3~4#1 != ~nomsg~0; {8453#false} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {8453#false} assume !(main_~node3__m3~4#1 > ~id3~0); {8453#false} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {8453#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; {8453#false} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {8453#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8453#false} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {8453#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {8453#false} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {8453#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; {8453#false} is VALID [2022-02-20 18:51:54,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {8453#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3692~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3692~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; {8453#false} is VALID [2022-02-20 18:51:54,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {8453#false} assume 0 == main_~assert__arg~11#1 % 256; {8453#false} is VALID [2022-02-20 18:51:54,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {8453#false} assume !false; {8453#false} is VALID [2022-02-20 18:51:54,407 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,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:54,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424533574] [2022-02-20 18:51:54,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424533574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:54,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:54,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:54,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461186602] [2022-02-20 18:51:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:54,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:54,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:54,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:54,447 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:54,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:54,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:54,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:54,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:54,448 INFO L87 Difference]: Start difference. First operand 338 states and 449 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:57,191 INFO L93 Difference]: Finished difference Result 779 states and 1074 transitions. [2022-02-20 18:51:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:57,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 776 transitions. [2022-02-20 18:51:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 776 transitions. [2022-02-20 18:51:57,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 776 transitions. [2022-02-20 18:51:57,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 776 edges. 776 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:57,742 INFO L225 Difference]: With dead ends: 779 [2022-02-20 18:51:57,742 INFO L226 Difference]: Without dead ends: 639 [2022-02-20 18:51:57,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:57,744 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 2050 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:57,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2050 Valid, 875 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-02-20 18:51:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 338. [2022-02-20 18:51:58,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:58,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 639 states. Second operand has 338 states, 327 states have (on average 1.3700305810397553) internal successors, (448), 337 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:58,142 INFO L74 IsIncluded]: Start isIncluded. First operand 639 states. Second operand has 338 states, 327 states have (on average 1.3700305810397553) internal successors, (448), 337 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:58,143 INFO L87 Difference]: Start difference. First operand 639 states. Second operand has 338 states, 327 states have (on average 1.3700305810397553) internal successors, (448), 337 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:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:58,159 INFO L93 Difference]: Finished difference Result 639 states and 871 transitions. [2022-02-20 18:51:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 871 transitions. [2022-02-20 18:51:58,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:58,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:58,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.3700305810397553) internal successors, (448), 337 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 639 states. [2022-02-20 18:51:58,161 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.3700305810397553) internal successors, (448), 337 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 639 states. [2022-02-20 18:51:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:58,176 INFO L93 Difference]: Finished difference Result 639 states and 871 transitions. [2022-02-20 18:51:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 871 transitions. [2022-02-20 18:51:58,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:58,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:58,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:58,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3700305810397553) internal successors, (448), 337 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:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 448 transitions. [2022-02-20 18:51:58,184 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 448 transitions. Word has length 62 [2022-02-20 18:51:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:58,184 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 448 transitions. [2022-02-20 18:51:58,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 448 transitions. [2022-02-20 18:51:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:51:58,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:58,186 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:58,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:51:58,187 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:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash -201639857, now seen corresponding path program 1 times [2022-02-20 18:51:58,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:58,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293111682] [2022-02-20 18:51:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:58,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {11210#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {11212#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:58,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {11212#(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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {11213#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {11214#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {11214#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {11214#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {11214#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:58,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {11215#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {11216#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:58,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {11216#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11216#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:58,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {11216#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {11216#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:58,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {11216#(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; {11216#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:58,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {11216#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {11216#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:58,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {11216#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {11216#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:58,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {11216#(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; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 4); {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,340 INFO L290 TraceCheckUtils]: 41: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,342 INFO L290 TraceCheckUtils]: 47: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {11217#(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; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {11217#(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; {11217#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:58,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {11217#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11218#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} is VALID [2022-02-20 18:51:58,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {11218#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {11211#false} is VALID [2022-02-20 18:51:58,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {11211#false} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {11211#false} is VALID [2022-02-20 18:51:58,344 INFO L290 TraceCheckUtils]: 56: Hoare triple {11211#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11211#false} is VALID [2022-02-20 18:51:58,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {11211#false} assume !(main_~node4__m4~8#1 != ~nomsg~0);~mode4~0 := 0; {11211#false} is VALID [2022-02-20 18:51:58,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {11211#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; {11211#false} is VALID [2022-02-20 18:51:58,345 INFO L290 TraceCheckUtils]: 59: Hoare triple {11211#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~14#1 := 0;~__return_4077~0 := main_~check__tmp~14#1;main_~main__c1~0#1 := ~__return_4077~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; {11211#false} is VALID [2022-02-20 18:51:58,345 INFO L290 TraceCheckUtils]: 60: Hoare triple {11211#false} assume 0 == main_~assert__arg~12#1 % 256; {11211#false} is VALID [2022-02-20 18:51:58,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {11211#false} assume !false; {11211#false} is VALID [2022-02-20 18:51:58,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:51:58,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:58,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293111682] [2022-02-20 18:51:58,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293111682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:58,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:58,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:58,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321127941] [2022-02-20 18:51:58,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:58,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:58,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:58,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:58,385 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:58,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:58,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:58,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:58,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:58,386 INFO L87 Difference]: Start difference. First operand 338 states and 448 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:01,898 INFO L93 Difference]: Finished difference Result 883 states and 1236 transitions. [2022-02-20 18:52:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:01,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:52:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 743 transitions. [2022-02-20 18:52:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 743 transitions. [2022-02-20 18:52:01,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 743 transitions. [2022-02-20 18:52:02,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 743 edges. 743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:02,641 INFO L225 Difference]: With dead ends: 883 [2022-02-20 18:52:02,641 INFO L226 Difference]: Without dead ends: 765 [2022-02-20 18:52:02,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:02,644 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 1856 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:02,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1856 Valid, 1005 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-02-20 18:52:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 338. [2022-02-20 18:52:03,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:03,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 765 states. Second operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 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:52:03,175 INFO L74 IsIncluded]: Start isIncluded. First operand 765 states. Second operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 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:52:03,175 INFO L87 Difference]: Start difference. First operand 765 states. Second operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 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:52:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:03,196 INFO L93 Difference]: Finished difference Result 765 states and 1061 transitions. [2022-02-20 18:52:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1061 transitions. [2022-02-20 18:52:03,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:03,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:03,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 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 765 states. [2022-02-20 18:52:03,198 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 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 765 states. [2022-02-20 18:52:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:03,217 INFO L93 Difference]: Finished difference Result 765 states and 1061 transitions. [2022-02-20 18:52:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1061 transitions. [2022-02-20 18:52:03,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:03,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:03,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:03,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 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:52:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 447 transitions. [2022-02-20 18:52:03,226 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 447 transitions. Word has length 62 [2022-02-20 18:52:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:03,228 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 447 transitions. [2022-02-20 18:52:03,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2022-02-20 18:52:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:03,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:03,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:03,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:03,229 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:52:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1938423665, now seen corresponding path program 1 times [2022-02-20 18:52:03,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:03,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174789076] [2022-02-20 18:52:03,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:03,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:03,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {14373#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {14375#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {14375#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {14376#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {14376#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {14376#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {14376#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {14377#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {14377#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {14377#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:03,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {14377#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:03,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {14378#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:03,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:03,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send2~0 != ~nomsg~0; {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:03,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {14379#(<= (+ ~nomsg~0 1) ~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; {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:03,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:03,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send3~0 != ~nomsg~0; {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:03,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {14379#(<= (+ ~nomsg~0 1) ~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; {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:03,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:03,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send4~0 != ~nomsg~0; {14379#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:03,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {14379#(<= (+ ~nomsg~0 1) ~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; {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:03,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:03,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(~r1~0 % 256 >= 4); {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:03,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:03,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:03,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256); {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:03,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:03,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == ~mode1~0 % 256); {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:03,407 INFO L290 TraceCheckUtils]: 45: Hoare triple {14380#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {14381#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} is VALID [2022-02-20 18:52:03,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {14381#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {14382#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:03,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {14382#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14382#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:03,408 INFO L290 TraceCheckUtils]: 48: Hoare triple {14382#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14383#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:52:03,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {14383#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {14374#false} is VALID [2022-02-20 18:52:03,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {14374#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {14374#false} is VALID [2022-02-20 18:52:03,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {14374#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14374#false} is VALID [2022-02-20 18:52:03,409 INFO L290 TraceCheckUtils]: 52: Hoare triple {14374#false} assume main_~node3__m3~1#1 != ~nomsg~0; {14374#false} is VALID [2022-02-20 18:52:03,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {14374#false} assume !(main_~node3__m3~1#1 > ~id3~0); {14374#false} is VALID [2022-02-20 18:52:03,410 INFO L290 TraceCheckUtils]: 54: Hoare triple {14374#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; {14374#false} is VALID [2022-02-20 18:52:03,410 INFO L290 TraceCheckUtils]: 55: Hoare triple {14374#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14374#false} is VALID [2022-02-20 18:52:03,410 INFO L290 TraceCheckUtils]: 56: Hoare triple {14374#false} assume main_~node4__m4~3#1 != ~nomsg~0; {14374#false} is VALID [2022-02-20 18:52:03,411 INFO L290 TraceCheckUtils]: 57: Hoare triple {14374#false} assume !(main_~node4__m4~3#1 > ~id4~0); {14374#false} is VALID [2022-02-20 18:52:03,411 INFO L290 TraceCheckUtils]: 58: Hoare triple {14374#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; {14374#false} is VALID [2022-02-20 18:52:03,411 INFO L290 TraceCheckUtils]: 59: Hoare triple {14374#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~5#1 := 0;~__return_3778~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_3778~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; {14374#false} is VALID [2022-02-20 18:52:03,411 INFO L290 TraceCheckUtils]: 60: Hoare triple {14374#false} assume 0 == main_~assert__arg~5#1 % 256; {14374#false} is VALID [2022-02-20 18:52:03,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {14374#false} assume !false; {14374#false} is VALID [2022-02-20 18:52:03,411 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:03,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:03,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174789076] [2022-02-20 18:52:03,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174789076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:03,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:03,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:52:03,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276757498] [2022-02-20 18:52:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:52:03,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:03,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:03,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:52:03,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:52:03,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:03,452 INFO L87 Difference]: Start difference. First operand 338 states and 447 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:06,252 INFO L93 Difference]: Finished difference Result 801 states and 1103 transitions. [2022-02-20 18:52:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:52:06,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:52:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 773 transitions. [2022-02-20 18:52:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 773 transitions. [2022-02-20 18:52:06,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 773 transitions. [2022-02-20 18:52:06,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 773 edges. 773 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:06,858 INFO L225 Difference]: With dead ends: 801 [2022-02-20 18:52:06,858 INFO L226 Difference]: Without dead ends: 631 [2022-02-20 18:52:06,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:52:06,859 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 1210 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:06,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1210 Valid, 1098 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-02-20 18:52:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 338. [2022-02-20 18:52:07,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:07,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 631 states. Second operand has 338 states, 327 states have (on average 1.3608562691131498) internal successors, (445), 337 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:52:07,349 INFO L74 IsIncluded]: Start isIncluded. First operand 631 states. Second operand has 338 states, 327 states have (on average 1.3608562691131498) internal successors, (445), 337 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:52:07,349 INFO L87 Difference]: Start difference. First operand 631 states. Second operand has 338 states, 327 states have (on average 1.3608562691131498) internal successors, (445), 337 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:52:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,362 INFO L93 Difference]: Finished difference Result 631 states and 859 transitions. [2022-02-20 18:52:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 859 transitions. [2022-02-20 18:52:07,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.3608562691131498) internal successors, (445), 337 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 631 states. [2022-02-20 18:52:07,364 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.3608562691131498) internal successors, (445), 337 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 631 states. [2022-02-20 18:52:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,376 INFO L93 Difference]: Finished difference Result 631 states and 859 transitions. [2022-02-20 18:52:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 859 transitions. [2022-02-20 18:52:07,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:07,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3608562691131498) internal successors, (445), 337 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:52:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 445 transitions. [2022-02-20 18:52:07,387 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 445 transitions. Word has length 62 [2022-02-20 18:52:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:07,388 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 445 transitions. [2022-02-20 18:52:07,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 445 transitions. [2022-02-20 18:52:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:07,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:07,389 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:07,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:07,389 INFO L402 AbstractCegarLoop]: === Iteration 8 === 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:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1233191565, now seen corresponding path program 1 times [2022-02-20 18:52:07,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:07,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433575710] [2022-02-20 18:52:07,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:07,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:07,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {17130#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {17132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {17132#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {17133#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {17134#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {17134#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {17134#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:07,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {17134#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {17135#(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; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {17135#(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; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {17135#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:07,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {17135#(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; {17136#(<= (+ ~nomsg~0 1) ~p3_new~0)} is VALID [2022-02-20 18:52:07,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {17136#(<= (+ ~nomsg~0 1) ~p3_new~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {17136#(<= (+ ~nomsg~0 1) ~p3_new~0)} is VALID [2022-02-20 18:52:07,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {17136#(<= (+ ~nomsg~0 1) ~p3_new~0)} assume ~send4~0 != ~nomsg~0; {17136#(<= (+ ~nomsg~0 1) ~p3_new~0)} is VALID [2022-02-20 18:52:07,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {17136#(<= (+ ~nomsg~0 1) ~p3_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; {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:07,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:07,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume !(~r1~0 % 256 >= 4); {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:07,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:07,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:07,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256); {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:07,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:07,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume !(0 == ~mode1~0 % 256); {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:07,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {17137#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {17138#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p3_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} is VALID [2022-02-20 18:52:07,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {17138#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p3_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {17139#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {17139#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {17139#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {17139#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {17139#(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; {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {17139#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {17139#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~3#1 != ~nomsg~0; {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {17139#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~3#1 > ~id3~0); {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {17139#(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; {17139#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:07,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {17139#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {17140#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~5#1|))} is VALID [2022-02-20 18:52:07,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {17140#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~5#1|))} assume !(main_~node4__m4~5#1 != ~nomsg~0);~mode4~0 := 0; {17131#false} is VALID [2022-02-20 18:52:07,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {17131#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; {17131#false} is VALID [2022-02-20 18:52:07,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {17131#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~8#1 := 0;~__return_4335~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_4335~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; {17131#false} is VALID [2022-02-20 18:52:07,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {17131#false} assume 0 == main_~assert__arg~8#1 % 256; {17131#false} is VALID [2022-02-20 18:52:07,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {17131#false} assume !false; {17131#false} is VALID [2022-02-20 18:52:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:07,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:07,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433575710] [2022-02-20 18:52:07,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433575710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:07,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:07,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:52:07,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265202494] [2022-02-20 18:52:07,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:07,571 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:52:07,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:07,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:07,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:52:07,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:07,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:52:07,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:07,608 INFO L87 Difference]: Start difference. First operand 338 states and 445 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:10,937 INFO L93 Difference]: Finished difference Result 742 states and 1020 transitions. [2022-02-20 18:52:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:52:10,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:52:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 630 transitions. [2022-02-20 18:52:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 630 transitions. [2022-02-20 18:52:10,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 630 transitions. [2022-02-20 18:52:11,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 630 edges. 630 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:11,376 INFO L225 Difference]: With dead ends: 742 [2022-02-20 18:52:11,376 INFO L226 Difference]: Without dead ends: 737 [2022-02-20 18:52:11,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:52:11,377 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 1475 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:11,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1475 Valid, 1148 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-02-20 18:52:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 338. [2022-02-20 18:52:12,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:12,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 737 states. Second operand has 338 states, 327 states have (on average 1.3547400611620795) internal successors, (443), 337 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:12,001 INFO L74 IsIncluded]: Start isIncluded. First operand 737 states. Second operand has 338 states, 327 states have (on average 1.3547400611620795) internal successors, (443), 337 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:12,002 INFO L87 Difference]: Start difference. First operand 737 states. Second operand has 338 states, 327 states have (on average 1.3547400611620795) internal successors, (443), 337 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:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:12,020 INFO L93 Difference]: Finished difference Result 737 states and 1014 transitions. [2022-02-20 18:52:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2022-02-20 18:52:12,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:12,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:12,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.3547400611620795) internal successors, (443), 337 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 737 states. [2022-02-20 18:52:12,022 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.3547400611620795) internal successors, (443), 337 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 737 states. [2022-02-20 18:52:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:12,040 INFO L93 Difference]: Finished difference Result 737 states and 1014 transitions. [2022-02-20 18:52:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2022-02-20 18:52:12,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:12,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:12,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:12,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3547400611620795) internal successors, (443), 337 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:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 443 transitions. [2022-02-20 18:52:12,049 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 443 transitions. Word has length 62 [2022-02-20 18:52:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:12,049 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 443 transitions. [2022-02-20 18:52:12,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 443 transitions. [2022-02-20 18:52:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:12,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:12,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:12,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:12,051 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash 679005537, now seen corresponding path program 1 times [2022-02-20 18:52:12,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:12,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970197031] [2022-02-20 18:52:12,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:12,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {20034#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {20036#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:12,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {20036#(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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,184 INFO L290 TraceCheckUtils]: 4: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {20037#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {20038#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {20038#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {20038#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {20038#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 != ~nomsg~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 != ~nomsg~0; {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:12,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {20039#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {20040#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:12,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {20040#(not (= ~nomsg~0 ~p4_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {20040#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:12,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {20040#(not (= ~nomsg~0 ~p4_old~0))} assume !(~r1~0 % 256 >= 4); {20040#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:12,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {20040#(not (= ~nomsg~0 ~p4_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {20040#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:12,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {20040#(not (= ~nomsg~0 ~p4_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {20040#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:12,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {20040#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {20040#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:12,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {20040#(not (= ~nomsg~0 ~p4_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {20040#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:12,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {20040#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == ~mode1~0 % 256); {20040#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:12,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {20040#(not (= ~nomsg~0 ~p4_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {20041#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:12,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {20041#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {20035#false} is VALID [2022-02-20 18:52:12,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {20035#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {20035#false} is VALID [2022-02-20 18:52:12,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {20035#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20035#false} is VALID [2022-02-20 18:52:12,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {20035#false} assume main_~node2__m2~1#1 != ~nomsg~0; {20035#false} is VALID [2022-02-20 18:52:12,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {20035#false} assume !(main_~node2__m2~1#1 > ~id2~0); {20035#false} is VALID [2022-02-20 18:52:12,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {20035#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {20035#false} is VALID [2022-02-20 18:52:12,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {20035#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20035#false} is VALID [2022-02-20 18:52:12,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {20035#false} assume !(main_~node3__m3~3#1 != ~nomsg~0);~mode3~0 := 0; {20035#false} is VALID [2022-02-20 18:52:12,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {20035#false} havoc main_~node4__m4~4#1;main_~node4__m4~4#1 := ~nomsg~0; {20035#false} is VALID [2022-02-20 18:52:12,201 INFO L290 TraceCheckUtils]: 55: Hoare triple {20035#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~4#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20035#false} is VALID [2022-02-20 18:52:12,201 INFO L290 TraceCheckUtils]: 56: Hoare triple {20035#false} assume main_~node4__m4~4#1 != ~nomsg~0; {20035#false} is VALID [2022-02-20 18:52:12,201 INFO L290 TraceCheckUtils]: 57: Hoare triple {20035#false} assume !(main_~node4__m4~4#1 > ~id4~0); {20035#false} is VALID [2022-02-20 18:52:12,202 INFO L290 TraceCheckUtils]: 58: Hoare triple {20035#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; {20035#false} is VALID [2022-02-20 18:52:12,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {20035#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_4161~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_4161~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; {20035#false} is VALID [2022-02-20 18:52:12,202 INFO L290 TraceCheckUtils]: 60: Hoare triple {20035#false} assume 0 == main_~assert__arg~7#1 % 256; {20035#false} is VALID [2022-02-20 18:52:12,202 INFO L290 TraceCheckUtils]: 61: Hoare triple {20035#false} assume !false; {20035#false} is VALID [2022-02-20 18:52:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:12,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:12,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970197031] [2022-02-20 18:52:12,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970197031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:12,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:12,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:52:12,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351070448] [2022-02-20 18:52:12,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:52:12,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:12,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:12,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:12,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:52:12,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:52:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:52:12,240 INFO L87 Difference]: Start difference. First operand 338 states and 443 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:14,687 INFO L93 Difference]: Finished difference Result 688 states and 910 transitions. [2022-02-20 18:52:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:52:14,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:52:14,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2022-02-20 18:52:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2022-02-20 18:52:14,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 609 transitions. [2022-02-20 18:52:15,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:15,083 INFO L225 Difference]: With dead ends: 688 [2022-02-20 18:52:15,083 INFO L226 Difference]: Without dead ends: 503 [2022-02-20 18:52:15,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:52:15,084 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 1618 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:15,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1618 Valid, 632 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-20 18:52:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 338. [2022-02-20 18:52:15,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:15,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 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:15,787 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 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:15,787 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 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:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:15,796 INFO L93 Difference]: Finished difference Result 503 states and 656 transitions. [2022-02-20 18:52:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 656 transitions. [2022-02-20 18:52:15,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:15,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:15,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 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 503 states. [2022-02-20 18:52:15,797 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 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 503 states. [2022-02-20 18:52:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:15,806 INFO L93 Difference]: Finished difference Result 503 states and 656 transitions. [2022-02-20 18:52:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 656 transitions. [2022-02-20 18:52:15,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:15,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:15,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:15,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 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:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2022-02-20 18:52:15,812 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 62 [2022-02-20 18:52:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:15,812 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2022-02-20 18:52:15,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2022-02-20 18:52:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:15,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:15,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:15,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:15,813 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2031197374, now seen corresponding path program 1 times [2022-02-20 18:52:15,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:15,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549408205] [2022-02-20 18:52:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:15,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {22375#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {22377#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:15,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {22377#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {22378#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {22379#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {22379#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {22379#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:15,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {22379#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {22380#(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; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {22380#(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; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {22380#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:15,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {22380#(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; {22381#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {22381#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {22381#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {22381#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {22381#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {22381#(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; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256); {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {22382#(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; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,941 INFO L290 TraceCheckUtils]: 52: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} ~mode2~0 := 0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~4#1 != ~nomsg~0; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~4#1 > ~id3~0); {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {22382#(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; {22382#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:15,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {22382#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22383#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} is VALID [2022-02-20 18:52:15,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {22383#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {22376#false} is VALID [2022-02-20 18:52:15,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {22376#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; {22376#false} is VALID [2022-02-20 18:52:15,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {22376#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3692~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3692~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; {22376#false} is VALID [2022-02-20 18:52:15,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {22376#false} assume 0 == main_~assert__arg~11#1 % 256; {22376#false} is VALID [2022-02-20 18:52:15,944 INFO L290 TraceCheckUtils]: 63: Hoare triple {22376#false} assume !false; {22376#false} is VALID [2022-02-20 18:52:15,944 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,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:15,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549408205] [2022-02-20 18:52:15,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549408205] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:15,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:15,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:15,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065934999] [2022-02-20 18:52:15,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:15,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:15,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:15,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:15,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:15,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:15,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:15,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:15,992 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,406 INFO L93 Difference]: Finished difference Result 856 states and 1186 transitions. [2022-02-20 18:52:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 714 transitions. [2022-02-20 18:52:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 714 transitions. [2022-02-20 18:52:19,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 714 transitions. [2022-02-20 18:52:19,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 714 edges. 714 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,863 INFO L225 Difference]: With dead ends: 856 [2022-02-20 18:52:19,863 INFO L226 Difference]: Without dead ends: 745 [2022-02-20 18:52:19,863 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:19,863 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 949 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:19,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [949 Valid, 962 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-02-20 18:52:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 338. [2022-02-20 18:52:20,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:20,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 745 states. Second operand has 338 states, 327 states have (on average 1.348623853211009) internal successors, (441), 337 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:20,573 INFO L74 IsIncluded]: Start isIncluded. First operand 745 states. Second operand has 338 states, 327 states have (on average 1.348623853211009) internal successors, (441), 337 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:20,573 INFO L87 Difference]: Start difference. First operand 745 states. Second operand has 338 states, 327 states have (on average 1.348623853211009) internal successors, (441), 337 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:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:20,591 INFO L93 Difference]: Finished difference Result 745 states and 1020 transitions. [2022-02-20 18:52:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1020 transitions. [2022-02-20 18:52:20,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:20,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:20,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.348623853211009) internal successors, (441), 337 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 745 states. [2022-02-20 18:52:20,595 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.348623853211009) internal successors, (441), 337 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 745 states. [2022-02-20 18:52:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:20,613 INFO L93 Difference]: Finished difference Result 745 states and 1020 transitions. [2022-02-20 18:52:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1020 transitions. [2022-02-20 18:52:20,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:20,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:20,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:20,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.348623853211009) internal successors, (441), 337 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:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 441 transitions. [2022-02-20 18:52:20,621 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 441 transitions. Word has length 64 [2022-02-20 18:52:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:20,622 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 441 transitions. [2022-02-20 18:52:20,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 441 transitions. [2022-02-20 18:52:20,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:20,622 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:20,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:20,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:20,623 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:20,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash -119000272, now seen corresponding path program 1 times [2022-02-20 18:52:20,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:20,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504226009] [2022-02-20 18:52:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:20,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:20,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {25465#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {25467#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:20,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {25467#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:20,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:20,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:20,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:20,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:20,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:20,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {25468#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {25469#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:20,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {25469#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st2~0; {25469#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:20,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {25469#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:20,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {25470#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {25471#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:20,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {25471#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {25471#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:20,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {25471#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {25471#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:20,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {25471#(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; {25471#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:20,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {25471#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {25471#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:20,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {25471#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {25471#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:20,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {25471#(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; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 4); {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,761 INFO L290 TraceCheckUtils]: 46: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,762 INFO L290 TraceCheckUtils]: 47: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {25472#(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; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {25472#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:20,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {25472#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25473#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:52:20,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {25473#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {25466#false} is VALID [2022-02-20 18:52:20,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {25466#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {25466#false} is VALID [2022-02-20 18:52:20,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {25466#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25466#false} is VALID [2022-02-20 18:52:20,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {25466#false} assume main_~node4__m4~6#1 != ~nomsg~0; {25466#false} is VALID [2022-02-20 18:52:20,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {25466#false} assume !(main_~node4__m4~6#1 > ~id4~0); {25466#false} is VALID [2022-02-20 18:52:20,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {25466#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; {25466#false} is VALID [2022-02-20 18:52:20,765 INFO L290 TraceCheckUtils]: 61: Hoare triple {25466#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_3495~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_3495~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; {25466#false} is VALID [2022-02-20 18:52:20,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {25466#false} assume 0 == main_~assert__arg~10#1 % 256; {25466#false} is VALID [2022-02-20 18:52:20,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {25466#false} assume !false; {25466#false} is VALID [2022-02-20 18:52:20,765 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,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:20,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504226009] [2022-02-20 18:52:20,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504226009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:20,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:20,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:20,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014769258] [2022-02-20 18:52:20,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:20,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:20,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:20,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:20,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:20,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:20,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:20,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:20,811 INFO L87 Difference]: Start difference. First operand 338 states and 441 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:24,838 INFO L93 Difference]: Finished difference Result 888 states and 1233 transitions. [2022-02-20 18:52:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 742 transitions. [2022-02-20 18:52:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 742 transitions. [2022-02-20 18:52:24,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 742 transitions. [2022-02-20 18:52:25,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 742 edges. 742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:25,363 INFO L225 Difference]: With dead ends: 888 [2022-02-20 18:52:25,363 INFO L226 Difference]: Without dead ends: 765 [2022-02-20 18:52:25,364 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:25,364 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 1261 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:25,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1261 Valid, 1251 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-02-20 18:52:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 338. [2022-02-20 18:52:26,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:26,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 765 states. Second operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (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,100 INFO L74 IsIncluded]: Start isIncluded. First operand 765 states. Second operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (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,105 INFO L87 Difference]: Start difference. First operand 765 states. Second operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (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,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,123 INFO L93 Difference]: Finished difference Result 765 states and 1052 transitions. [2022-02-20 18:52:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1052 transitions. [2022-02-20 18:52:26,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 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 765 states. [2022-02-20 18:52:26,128 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 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 765 states. [2022-02-20 18:52:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,145 INFO L93 Difference]: Finished difference Result 765 states and 1052 transitions. [2022-02-20 18:52:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1052 transitions. [2022-02-20 18:52:26,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:26,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (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,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 440 transitions. [2022-02-20 18:52:26,153 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 440 transitions. Word has length 64 [2022-02-20 18:52:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:26,153 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 440 transitions. [2022-02-20 18:52:26,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 440 transitions. [2022-02-20 18:52:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:26,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:26,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:26,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:26,154 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1520301075, now seen corresponding path program 1 times [2022-02-20 18:52:26,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:26,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503465249] [2022-02-20 18:52:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:26,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {28631#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {28633#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:26,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {28633#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {28634#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {28635#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {28635#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {28635#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:26,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {28635#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {28636#(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; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {28636#(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; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {28636#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:26,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {28636#(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; {28637#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {28637#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {28637#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {28637#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {28637#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {28637#(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; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256); {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {28638#(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; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,287 INFO L290 TraceCheckUtils]: 52: Hoare triple {28638#(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; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,287 INFO L290 TraceCheckUtils]: 53: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 != ~nomsg~0; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~5#1 > ~id3~0); {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,288 INFO L290 TraceCheckUtils]: 56: Hoare triple {28638#(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; {28638#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:26,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {28638#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28639#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~9#1|))} is VALID [2022-02-20 18:52:26,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {28639#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~9#1|))} assume !(main_~node4__m4~9#1 != ~nomsg~0);~mode4~0 := 0; {28632#false} is VALID [2022-02-20 18:52:26,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {28632#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; {28632#false} is VALID [2022-02-20 18:52:26,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {28632#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~16#1 := 0;~__return_4417~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_4417~0; {28632#false} is VALID [2022-02-20 18:52:26,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {28632#false} 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; {28632#false} is VALID [2022-02-20 18:52:26,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {28632#false} assume 0 == main_~assert__arg~2#1 % 256; {28632#false} is VALID [2022-02-20 18:52:26,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {28632#false} assume !false; {28632#false} is VALID [2022-02-20 18:52:26,289 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,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:26,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503465249] [2022-02-20 18:52:26,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503465249] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:26,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:26,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:26,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003287703] [2022-02-20 18:52:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:26,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:26,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:26,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:26,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:26,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:26,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:26,328 INFO L87 Difference]: Start difference. First operand 338 states and 440 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,077 INFO L93 Difference]: Finished difference Result 853 states and 1181 transitions. [2022-02-20 18:52:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:30,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 709 transitions. [2022-02-20 18:52:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 709 transitions. [2022-02-20 18:52:30,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 709 transitions. [2022-02-20 18:52:30,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 709 edges. 709 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:30,534 INFO L225 Difference]: With dead ends: 853 [2022-02-20 18:52:30,534 INFO L226 Difference]: Without dead ends: 745 [2022-02-20 18:52:30,535 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:30,535 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 872 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:30,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [872 Valid, 1116 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-02-20 18:52:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 338. [2022-02-20 18:52:31,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:31,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 745 states. Second operand has 338 states, 327 states have (on average 1.342507645259939) internal successors, (439), 337 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:31,326 INFO L74 IsIncluded]: Start isIncluded. First operand 745 states. Second operand has 338 states, 327 states have (on average 1.342507645259939) internal successors, (439), 337 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:31,326 INFO L87 Difference]: Start difference. First operand 745 states. Second operand has 338 states, 327 states have (on average 1.342507645259939) internal successors, (439), 337 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:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,343 INFO L93 Difference]: Finished difference Result 745 states and 1018 transitions. [2022-02-20 18:52:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1018 transitions. [2022-02-20 18:52:31,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.342507645259939) internal successors, (439), 337 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 745 states. [2022-02-20 18:52:31,345 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.342507645259939) internal successors, (439), 337 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 745 states. [2022-02-20 18:52:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,361 INFO L93 Difference]: Finished difference Result 745 states and 1018 transitions. [2022-02-20 18:52:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1018 transitions. [2022-02-20 18:52:31,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:31,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.342507645259939) internal successors, (439), 337 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:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 439 transitions. [2022-02-20 18:52:31,367 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 439 transitions. Word has length 64 [2022-02-20 18:52:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:31,367 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 439 transitions. [2022-02-20 18:52:31,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 439 transitions. [2022-02-20 18:52:31,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:31,368 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:31,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:31,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:52:31,369 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1508633347, now seen corresponding path program 1 times [2022-02-20 18:52:31,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:31,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173160516] [2022-02-20 18:52:31,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:31,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {31718#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {31720#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {31720#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {31721#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {31722#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {31722#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {31722#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {31722#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {31723#(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; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {31723#(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; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {31723#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {31723#(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; {31724#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {31724#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {31724#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {31724#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {31724#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {31724#(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; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256); {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {31725#(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; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {31725#(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; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 != ~nomsg~0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,490 INFO L290 TraceCheckUtils]: 55: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 > ~id3~0;~send3~0 := main_~node3__m3~5#1; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} ~mode3~0 := 0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {31725#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {31725#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {31726#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~8#1|))} is VALID [2022-02-20 18:52:31,491 INFO L290 TraceCheckUtils]: 59: Hoare triple {31726#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~8#1|))} assume !(main_~node4__m4~8#1 != ~nomsg~0);~mode4~0 := 0; {31719#false} is VALID [2022-02-20 18:52:31,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {31719#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; {31719#false} is VALID [2022-02-20 18:52:31,491 INFO L290 TraceCheckUtils]: 61: Hoare triple {31719#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~14#1 := 0;~__return_4077~0 := main_~check__tmp~14#1;main_~main__c1~0#1 := ~__return_4077~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; {31719#false} is VALID [2022-02-20 18:52:31,491 INFO L290 TraceCheckUtils]: 62: Hoare triple {31719#false} assume 0 == main_~assert__arg~12#1 % 256; {31719#false} is VALID [2022-02-20 18:52:31,491 INFO L290 TraceCheckUtils]: 63: Hoare triple {31719#false} assume !false; {31719#false} is VALID [2022-02-20 18:52:31,492 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:31,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:31,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173160516] [2022-02-20 18:52:31,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173160516] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:31,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:31,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:31,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976475527] [2022-02-20 18:52:31,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:31,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:31,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:31,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:31,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:31,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:31,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:31,540 INFO L87 Difference]: Start difference. First operand 338 states and 439 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:35,401 INFO L93 Difference]: Finished difference Result 750 states and 1022 transitions. [2022-02-20 18:52:35,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:35,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 629 transitions. [2022-02-20 18:52:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 629 transitions. [2022-02-20 18:52:35,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 629 transitions. [2022-02-20 18:52:35,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:35,814 INFO L225 Difference]: With dead ends: 750 [2022-02-20 18:52:35,814 INFO L226 Difference]: Without dead ends: 745 [2022-02-20 18:52:35,814 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:35,815 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 783 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:35,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [783 Valid, 1252 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-02-20 18:52:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 338. [2022-02-20 18:52:36,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:36,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 745 states. Second operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,636 INFO L74 IsIncluded]: Start isIncluded. First operand 745 states. Second operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,636 INFO L87 Difference]: Start difference. First operand 745 states. Second operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,653 INFO L93 Difference]: Finished difference Result 745 states and 1016 transitions. [2022-02-20 18:52:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1016 transitions. [2022-02-20 18:52:36,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 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 745 states. [2022-02-20 18:52:36,654 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 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 745 states. [2022-02-20 18:52:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,670 INFO L93 Difference]: Finished difference Result 745 states and 1016 transitions. [2022-02-20 18:52:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1016 transitions. [2022-02-20 18:52:36,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:36,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 438 transitions. [2022-02-20 18:52:36,676 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 438 transitions. Word has length 64 [2022-02-20 18:52:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:36,676 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 438 transitions. [2022-02-20 18:52:36,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 438 transitions. [2022-02-20 18:52:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:36,677 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:36,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:36,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:52:36,677 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:36,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1008042549, now seen corresponding path program 1 times [2022-02-20 18:52:36,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:36,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814585376] [2022-02-20 18:52:36,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:36,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {34658#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {34660#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:36,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {34660#(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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {34661#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {34662#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {34662#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {34662#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {34662#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:36,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {34663#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {34664#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {34664#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {34664#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {34664#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {34664#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {34664#(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; {34664#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {34664#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {34664#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {34664#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {34664#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {34664#(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; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 4); {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {34665#(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; {34665#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {34665#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {34666#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:52:36,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {34666#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} assume !(main_~node3__m3~3#1 != ~nomsg~0);~mode3~0 := 0; {34659#false} is VALID [2022-02-20 18:52:36,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {34659#false} havoc main_~node4__m4~4#1;main_~node4__m4~4#1 := ~nomsg~0; {34659#false} is VALID [2022-02-20 18:52:36,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {34659#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~4#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {34659#false} is VALID [2022-02-20 18:52:36,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {34659#false} assume main_~node4__m4~4#1 != ~nomsg~0; {34659#false} is VALID [2022-02-20 18:52:36,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {34659#false} assume !(main_~node4__m4~4#1 > ~id4~0); {34659#false} is VALID [2022-02-20 18:52:36,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {34659#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; {34659#false} is VALID [2022-02-20 18:52:36,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {34659#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_4161~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_4161~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; {34659#false} is VALID [2022-02-20 18:52:36,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {34659#false} assume 0 == main_~assert__arg~7#1 % 256; {34659#false} is VALID [2022-02-20 18:52:36,788 INFO L290 TraceCheckUtils]: 63: Hoare triple {34659#false} assume !false; {34659#false} is VALID [2022-02-20 18:52:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:36,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:36,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814585376] [2022-02-20 18:52:36,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814585376] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:36,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:36,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:36,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274746263] [2022-02-20 18:52:36,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:36,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:36,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:36,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:36,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:36,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:36,828 INFO L87 Difference]: Start difference. First operand 338 states and 438 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:41,080 INFO L93 Difference]: Finished difference Result 782 states and 1068 transitions. [2022-02-20 18:52:41,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:41,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 656 transitions. [2022-02-20 18:52:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 656 transitions. [2022-02-20 18:52:41,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 656 transitions. [2022-02-20 18:52:41,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 656 edges. 656 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:41,560 INFO L225 Difference]: With dead ends: 782 [2022-02-20 18:52:41,561 INFO L226 Difference]: Without dead ends: 765 [2022-02-20 18:52:41,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:41,561 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 1420 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:41,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1420 Valid, 1308 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-02-20 18:52:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 338. [2022-02-20 18:52:42,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:42,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 765 states. Second operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,309 INFO L74 IsIncluded]: Start isIncluded. First operand 765 states. Second operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,309 INFO L87 Difference]: Start difference. First operand 765 states. Second operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:42,327 INFO L93 Difference]: Finished difference Result 765 states and 1048 transitions. [2022-02-20 18:52:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1048 transitions. [2022-02-20 18:52:42,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:42,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:42,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 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 765 states. [2022-02-20 18:52:42,328 INFO L87 Difference]: Start difference. First operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 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 765 states. [2022-02-20 18:52:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:42,345 INFO L93 Difference]: Finished difference Result 765 states and 1048 transitions. [2022-02-20 18:52:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1048 transitions. [2022-02-20 18:52:42,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:42,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:42,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:42,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 436 transitions. [2022-02-20 18:52:42,354 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 436 transitions. Word has length 64 [2022-02-20 18:52:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:42,354 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 436 transitions. [2022-02-20 18:52:42,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 436 transitions. [2022-02-20 18:52:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:42,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:42,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:42,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:52:42,354 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:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash 370944031, now seen corresponding path program 1 times [2022-02-20 18:52:42,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:42,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605619807] [2022-02-20 18:52:42,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:42,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {37676#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_2904~0 := 0;~__return_4524~0 := 0;~__return_3074~0 := 0;~__return_3157~0 := 0;~__return_3425~0 := 0;~__return_3610~0 := 0;~__return_3778~0 := 0;~__return_3983~0 := 0;~__return_4161~0 := 0;~__return_4335~0 := 0;~__return_4495~0 := 0;~__return_3338~0 := 0;~__return_3495~0 := 0;~__return_3692~0 := 0;~__return_3850~0 := 0;~__return_4077~0 := 0;~__return_4231~0 := 0;~__return_4417~0 := 0;~__return_4460~0 := 0;~__return_4370~0 := 0;~__return_4288~0 := 0;~__return_4196~0 := 0;~__return_4126~0 := 0;~__return_4018~0 := 0;~__return_3921~0 := 0;~__return_3815~0 := 0;~__return_3743~0 := 0;~__return_3645~0 := 0;~__return_3560~0 := 0;~__return_3460~0 := 0;~__return_3387~0 := 0;~__return_3263~0 := 0;~__return_2995~0 := 0; {37676#true} is VALID [2022-02-20 18:52:42,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {37676#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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {37678#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:42,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {37678#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume 0 == ~r1~0 % 256; {37678#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:42,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {37678#(and (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume ~id1~0 >= 0; {37679#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:42,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {37679#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume 0 == ~st1~0; {37679#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:52:42,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {37679#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id4~0 (+ ~send1~0 255)))} assume ~send1~0 == ~id1~0; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode1~0 % 256; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id2~0 >= 0; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~st2~0; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~send2~0 == ~id2~0; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode2~0 % 256; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id3~0 >= 0; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~st3~0; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~send3~0 == ~id3~0; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume 0 == ~mode3~0 % 256; {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} is VALID [2022-02-20 18:52:42,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {37680#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= ~id4~0 (+ 255 ~id1~0)))} assume ~id4~0 >= 0; {37681#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} is VALID [2022-02-20 18:52:42,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {37681#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} assume 0 == ~st4~0; {37681#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} is VALID [2022-02-20 18:52:42,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {37681#(and (<= 0 ~id1~0) (<= ~id4~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id4~0 127)))} assume ~send4~0 == ~id4~0; {37682#(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:42,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {37682#(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; {37682#(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:42,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {37682#(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; {37682#(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:42,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {37682#(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; {37682#(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:42,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {37682#(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; {37683#(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:42,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {37683#(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; {37683#(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:42,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {37683#(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; {37683#(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:42,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {37683#(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_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {37683#(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:42,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {37683#(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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {37683#(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:42,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {37683#(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; {37683#(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:42,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {37683#(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; {37683#(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:42,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {37683#(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; {37683#(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:42,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {37683#(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; {37683#(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:42,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {37683#(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; {37683#(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:42,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {37683#(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; {37683#(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:42,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {37683#(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; {37683#(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:42,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {37683#(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; {37683#(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:42,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {37683#(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; {37683#(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:42,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {37683#(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; {37683#(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:42,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {37683#(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; {37683#(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:42,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {37683#(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; {37684#(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:42,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {37684#(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; {37684#(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:42,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {37684#(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 % 256 >= 4); {37684#(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:42,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {37684#(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; {37684#(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:42,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {37684#(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 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4524~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4524~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; {37684#(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:42,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {37684#(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); {37684#(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:42,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {37684#(or (<= (+ ~p4_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p4_old~0) (and (<= ~id4~0 ~p4_old~0) (<= (+ ~id1~0 1) ~id4~0)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {37684#(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:42,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {37684#(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); {37684#(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:42,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {37684#(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 !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {37685#(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:42,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {37685#(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; {37685#(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:42,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {37685#(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); {37686#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:52:42,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {37686#(<= (+ |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; {37677#false} is VALID [2022-02-20 18:52:42,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {37677#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {37677#false} is VALID [2022-02-20 18:52:42,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {37677#false} assume main_~node2__m2~3#1 != ~nomsg~0; {37677#false} is VALID [2022-02-20 18:52:42,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {37677#false} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {37677#false} is VALID [2022-02-20 18:52:42,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {37677#false} ~mode2~0 := 0; {37677#false} is VALID [2022-02-20 18:52:42,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {37677#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {37677#false} is VALID [2022-02-20 18:52:42,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {37677#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {37677#false} is VALID [2022-02-20 18:52:42,648 INFO L290 TraceCheckUtils]: 55: Hoare triple {37677#false} assume main_~node3__m3~4#1 != ~nomsg~0; {37677#false} is VALID [2022-02-20 18:52:42,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {37677#false} assume main_~node3__m3~4#1 > ~id3~0;~send3~0 := main_~node3__m3~4#1; {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {37677#false} ~mode3~0 := 0; {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {37677#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L290 TraceCheckUtils]: 59: Hoare triple {37677#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {37677#false} assume main_~node4__m4~6#1 != ~nomsg~0; {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {37677#false} assume !(main_~node4__m4~6#1 > ~id4~0); {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {37677#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; {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L290 TraceCheckUtils]: 63: Hoare triple {37677#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_3495~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_3495~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; {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L290 TraceCheckUtils]: 64: Hoare triple {37677#false} assume 0 == main_~assert__arg~10#1 % 256; {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {37677#false} assume !false; {37677#false} is VALID [2022-02-20 18:52:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:42,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:42,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605619807] [2022-02-20 18:52:42,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605619807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:42,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:42,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:52:42,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98960715] [2022-02-20 18:52:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:52:42,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:42,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:42,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:42,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:52:42,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:42,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:52:42,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:42,694 INFO L87 Difference]: Start difference. First operand 338 states and 436 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)