./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-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-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-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 f299e5c87ef8b927f907740b52cd3b6a05ddc6197a3b61da31c7c3837813d6c6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:49:39,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:49:39,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:49:39,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:49:39,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:49:39,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:49:39,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:49:39,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:49:39,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:49:39,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:49:39,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:49:39,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:49:39,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:49:39,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:49:39,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:49:39,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:49:39,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:49:39,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:49:39,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:49:39,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:49:39,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:49:39,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:49:39,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:49:39,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:49:39,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:49:39,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:49:39,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:49:39,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:49:39,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:49:39,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:49:39,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:49:39,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:49:39,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:49:39,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:49:39,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:49:39,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:49:39,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:49:39,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:49:39,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:49:39,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:49:39,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:49:39,769 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:49:39,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:49:39,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:49:39,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:49:39,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:49:39,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:49:39,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:49:39,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:49:39,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:49:39,802 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:49:39,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:49:39,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:49:39,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:49:39,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:49:39,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:49:39,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:49:39,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:49:39,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:49:39,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:49:39,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:49:39,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:49:39,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:49:39,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:49:39,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:49:39,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:49:39,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:39,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:49:39,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:49:39,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:49:39,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:49:39,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:49:39,807 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:49:39,807 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:49:39,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:49:39,808 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 -> f299e5c87ef8b927f907740b52cd3b6a05ddc6197a3b61da31c7c3837813d6c6 [2022-02-20 18:49:40,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:49:40,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:49:40,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:49:40,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:49:40,074 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:49:40,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:49:40,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab5edabd/939ba7377d6b4176a0ed985efcb17ea0/FLAG2729b3479 [2022-02-20 18:49:40,565 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:49:40,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:49:40,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab5edabd/939ba7377d6b4176a0ed985efcb17ea0/FLAG2729b3479 [2022-02-20 18:49:40,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab5edabd/939ba7377d6b4176a0ed985efcb17ea0 [2022-02-20 18:49:40,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:49:40,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:49:40,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:40,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:49:40,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:49:40,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:40" (1/1) ... [2022-02-20 18:49:40,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709ca62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:40, skipping insertion in model container [2022-02-20 18:49:40,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:40" (1/1) ... [2022-02-20 18:49:40,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:49:40,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:49:41,169 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-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2022-02-20 18:49:41,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:41,302 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:49:41,386 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-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2022-02-20 18:49:41,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:41,432 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:49:41,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41 WrapperNode [2022-02-20 18:49:41,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:41,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:41,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:49:41,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:49:41,441 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:49:41" (1/1) ... [2022-02-20 18:49:41,463 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:49:41" (1/1) ... [2022-02-20 18:49:41,518 INFO L137 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 920 [2022-02-20 18:49:41,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:41,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:49:41,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:49:41,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:49:41,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41" (1/1) ... [2022-02-20 18:49:41,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41" (1/1) ... [2022-02-20 18:49:41,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41" (1/1) ... [2022-02-20 18:49:41,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41" (1/1) ... [2022-02-20 18:49:41,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41" (1/1) ... [2022-02-20 18:49:41,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41" (1/1) ... [2022-02-20 18:49:41,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41" (1/1) ... [2022-02-20 18:49:41,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:49:41,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:49:41,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:49:41,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:49:41,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41" (1/1) ... [2022-02-20 18:49:41,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:41,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:49:41,604 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:49:41,630 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:49:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:49:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:49:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:49:41,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:49:41,795 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:49:41,797 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:49:42,681 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:49:42,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:49:42,698 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:49:42,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:42 BoogieIcfgContainer [2022-02-20 18:49:42,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:49:42,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:49:42,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:49:42,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:49:42,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:49:40" (1/3) ... [2022-02-20 18:49:42,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e952ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:42, skipping insertion in model container [2022-02-20 18:49:42,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:41" (2/3) ... [2022-02-20 18:49:42,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e952ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:42, skipping insertion in model container [2022-02-20 18:49:42,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:42" (3/3) ... [2022-02-20 18:49:42,708 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:49:42,714 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:49:42,715 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:49:42,764 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:49:42,769 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:49:42,769 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:49:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 247 states have (on average 1.7246963562753037) internal successors, (426), 248 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 18:49:42,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:42,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:49:42,813 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -678392844, now seen corresponding path program 1 times [2022-02-20 18:49:42,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:42,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066011384] [2022-02-20 18:49:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:43,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_104949~0 := 0;~__return_105089~0 := 0;~__return_105309~0 := 0; {252#true} is VALID [2022-02-20 18:49:43,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#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_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {252#true} is VALID [2022-02-20 18:49:43,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#true} assume 0 == ~r1~0 % 256; {252#true} is VALID [2022-02-20 18:49:43,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {252#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {252#true} is VALID [2022-02-20 18:49:43,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {252#true} assume ~id1~0 >= 0; {252#true} is VALID [2022-02-20 18:49:43,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {252#true} assume 0 == ~st1~0; {254#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:43,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {254#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:43,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {254#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:43,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#(<= ~st1~0 0)} assume ~id2~0 >= 0; {254#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:43,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#(<= ~st1~0 0)} assume 0 == ~st2~0; {255#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {255#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {255#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {255#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {255#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {256#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {256#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {256#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {256#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {256#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {256#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {256#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {257#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {257#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {257#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {257#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {257#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {257#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {258#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {258#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {258#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {258#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {258#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {258#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {258#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:43,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {258#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive1~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive2~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~id2~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive3~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~id3~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,388 INFO L290 TraceCheckUtils]: 55: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive4~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~id4~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive5~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~id5~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive6~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~id6~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,398 INFO L290 TraceCheckUtils]: 66: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,399 INFO L290 TraceCheckUtils]: 68: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_105089~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105089~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; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,402 INFO L290 TraceCheckUtils]: 70: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode1~0 % 256); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,403 INFO L290 TraceCheckUtils]: 71: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,404 INFO L290 TraceCheckUtils]: 73: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,404 INFO L290 TraceCheckUtils]: 74: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,411 INFO L290 TraceCheckUtils]: 75: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,413 INFO L290 TraceCheckUtils]: 76: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,413 INFO L290 TraceCheckUtils]: 77: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,414 INFO L290 TraceCheckUtils]: 78: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,415 INFO L290 TraceCheckUtils]: 79: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,417 INFO L290 TraceCheckUtils]: 80: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,419 INFO L290 TraceCheckUtils]: 81: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,420 INFO L290 TraceCheckUtils]: 82: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,420 INFO L290 TraceCheckUtils]: 83: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,421 INFO L290 TraceCheckUtils]: 84: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,423 INFO L290 TraceCheckUtils]: 85: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,423 INFO L290 TraceCheckUtils]: 86: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,424 INFO L290 TraceCheckUtils]: 87: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,424 INFO L290 TraceCheckUtils]: 88: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node6__m6~1#1 != ~nomsg~0); {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,425 INFO L290 TraceCheckUtils]: 89: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~0 := 0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,426 INFO L290 TraceCheckUtils]: 90: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:43,427 INFO L290 TraceCheckUtils]: 91: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~1#1 := 0; {253#false} is VALID [2022-02-20 18:49:43,427 INFO L290 TraceCheckUtils]: 92: Hoare triple {253#false} ~__return_105309~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105309~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {253#false} is VALID [2022-02-20 18:49:43,428 INFO L290 TraceCheckUtils]: 93: Hoare triple {253#false} assume 0 == main_~assert__arg~1#1 % 256; {253#false} is VALID [2022-02-20 18:49:43,428 INFO L290 TraceCheckUtils]: 94: Hoare triple {253#false} assume !false; {253#false} is VALID [2022-02-20 18:49:43,430 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:49:43,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:43,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066011384] [2022-02-20 18:49:43,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066011384] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:43,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:43,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:49:43,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725636528] [2022-02-20 18:49:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:43,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 18:49:43,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:43,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:43,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:43,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:49:43,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:43,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:49:43,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:43,567 INFO L87 Difference]: Start difference. First operand has 249 states, 247 states have (on average 1.7246963562753037) internal successors, (426), 248 states have internal predecessors, (426), 0 states have call successors, (0), 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 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:47,730 INFO L93 Difference]: Finished difference Result 1119 states and 1815 transitions. [2022-02-20 18:49:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:49:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 18:49:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1815 transitions. [2022-02-20 18:49:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1815 transitions. [2022-02-20 18:49:47,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1815 transitions. [2022-02-20 18:49:49,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1815 edges. 1815 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:49,258 INFO L225 Difference]: With dead ends: 1119 [2022-02-20 18:49:49,258 INFO L226 Difference]: Without dead ends: 983 [2022-02-20 18:49:49,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:49:49,265 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 4169 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4169 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:49,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4169 Valid, 3698 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:49:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2022-02-20 18:49:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 381. [2022-02-20 18:49:49,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:49,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 983 states. Second operand has 381 states, 380 states have (on average 1.5052631578947369) internal successors, (572), 380 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:49,540 INFO L74 IsIncluded]: Start isIncluded. First operand 983 states. Second operand has 381 states, 380 states have (on average 1.5052631578947369) internal successors, (572), 380 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:49,541 INFO L87 Difference]: Start difference. First operand 983 states. Second operand has 381 states, 380 states have (on average 1.5052631578947369) internal successors, (572), 380 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:49,600 INFO L93 Difference]: Finished difference Result 983 states and 1532 transitions. [2022-02-20 18:49:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1532 transitions. [2022-02-20 18:49:49,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:49,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:49,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 380 states have (on average 1.5052631578947369) internal successors, (572), 380 states have internal predecessors, (572), 0 states have call successors, (0), 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 983 states. [2022-02-20 18:49:49,610 INFO L87 Difference]: Start difference. First operand has 381 states, 380 states have (on average 1.5052631578947369) internal successors, (572), 380 states have internal predecessors, (572), 0 states have call successors, (0), 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 983 states. [2022-02-20 18:49:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:49,675 INFO L93 Difference]: Finished difference Result 983 states and 1532 transitions. [2022-02-20 18:49:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1532 transitions. [2022-02-20 18:49:49,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:49,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:49,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:49,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.5052631578947369) internal successors, (572), 380 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 572 transitions. [2022-02-20 18:49:49,693 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 572 transitions. Word has length 95 [2022-02-20 18:49:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:49,695 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 572 transitions. [2022-02-20 18:49:49,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 572 transitions. [2022-02-20 18:49:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 18:49:49,700 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:49,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:49:49,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:49:49,701 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:49,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:49,702 INFO L85 PathProgramCache]: Analyzing trace with hash 118593259, now seen corresponding path program 1 times [2022-02-20 18:49:49,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:49,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158370648] [2022-02-20 18:49:49,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:49,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:50,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {4231#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_104949~0 := 0;~__return_105089~0 := 0;~__return_105309~0 := 0; {4231#true} is VALID [2022-02-20 18:49:50,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#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_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {4231#true} is VALID [2022-02-20 18:49:50,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume 0 == ~r1~0 % 256; {4231#true} is VALID [2022-02-20 18:49:50,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {4231#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id6~0 >= 0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st6~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send6~0 == ~id6~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode6~0 % 256; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id6~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id6~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id6~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id6~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:50,072 INFO L290 TraceCheckUtils]: 45: Hoare triple {4233#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {4234#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:50,072 INFO L290 TraceCheckUtils]: 46: Hoare triple {4234#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4234#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:50,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {4234#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {4234#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:50,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {4234#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {4235#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:50,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {4235#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {4235#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:50,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {4235#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4235#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:50,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {4235#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {4235#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:50,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {4235#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {4236#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:50,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {4236#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {4236#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:50,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {4236#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {4236#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:50,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {4236#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !!(0 == ~mode4~0 % 256); {4236#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:50,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {4236#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !!(0 == ~alive4~0 % 256); {4237#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:50,079 INFO L290 TraceCheckUtils]: 57: Hoare triple {4237#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !(~send4~0 != ~id4~0); {4237#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:50,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {4237#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {4237#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:50,080 INFO L290 TraceCheckUtils]: 59: Hoare triple {4237#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !!(0 == ~mode5~0 % 256); {4237#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:50,081 INFO L290 TraceCheckUtils]: 60: Hoare triple {4237#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !!(0 == ~alive5~0 % 256); {4238#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:50,081 INFO L290 TraceCheckUtils]: 61: Hoare triple {4238#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !(~send5~0 != ~id5~0); {4238#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:50,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {4238#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {4238#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:50,082 INFO L290 TraceCheckUtils]: 63: Hoare triple {4238#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !!(0 == ~mode6~0 % 256); {4238#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:50,083 INFO L290 TraceCheckUtils]: 64: Hoare triple {4238#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !!(0 == ~alive6~0 % 256); {4232#false} is VALID [2022-02-20 18:49:50,083 INFO L290 TraceCheckUtils]: 65: Hoare triple {4232#false} assume !(~send6~0 != ~id6~0); {4232#false} is VALID [2022-02-20 18:49:50,083 INFO L290 TraceCheckUtils]: 66: Hoare triple {4232#false} ~mode6~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4232#false} is VALID [2022-02-20 18:49:50,083 INFO L290 TraceCheckUtils]: 67: Hoare triple {4232#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {4232#false} is VALID [2022-02-20 18:49:50,083 INFO L290 TraceCheckUtils]: 68: Hoare triple {4232#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_105089~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105089~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; {4232#false} is VALID [2022-02-20 18:49:50,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {4232#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {4232#false} assume !(0 == ~mode1~0 % 256); {4232#false} is VALID [2022-02-20 18:49:50,084 INFO L290 TraceCheckUtils]: 71: Hoare triple {4232#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {4232#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4232#false} is VALID [2022-02-20 18:49:50,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {4232#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,085 INFO L290 TraceCheckUtils]: 74: Hoare triple {4232#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,085 INFO L290 TraceCheckUtils]: 75: Hoare triple {4232#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4232#false} is VALID [2022-02-20 18:49:50,085 INFO L290 TraceCheckUtils]: 76: Hoare triple {4232#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,085 INFO L290 TraceCheckUtils]: 77: Hoare triple {4232#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,085 INFO L290 TraceCheckUtils]: 78: Hoare triple {4232#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {4232#false} is VALID [2022-02-20 18:49:50,086 INFO L290 TraceCheckUtils]: 79: Hoare triple {4232#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,086 INFO L290 TraceCheckUtils]: 80: Hoare triple {4232#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,086 INFO L290 TraceCheckUtils]: 81: Hoare triple {4232#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {4232#false} is VALID [2022-02-20 18:49:50,086 INFO L290 TraceCheckUtils]: 82: Hoare triple {4232#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,086 INFO L290 TraceCheckUtils]: 83: Hoare triple {4232#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,087 INFO L290 TraceCheckUtils]: 84: Hoare triple {4232#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {4232#false} is VALID [2022-02-20 18:49:50,087 INFO L290 TraceCheckUtils]: 85: Hoare triple {4232#false} ~mode5~0 := 0; {4232#false} is VALID [2022-02-20 18:49:50,087 INFO L290 TraceCheckUtils]: 86: Hoare triple {4232#false} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,087 INFO L290 TraceCheckUtils]: 87: Hoare triple {4232#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {4232#false} is VALID [2022-02-20 18:49:50,087 INFO L290 TraceCheckUtils]: 88: Hoare triple {4232#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {4232#false} is VALID [2022-02-20 18:49:50,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {4232#false} ~mode6~0 := 0; {4232#false} is VALID [2022-02-20 18:49:50,088 INFO L290 TraceCheckUtils]: 90: Hoare triple {4232#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {4232#false} is VALID [2022-02-20 18:49:50,088 INFO L290 TraceCheckUtils]: 91: Hoare triple {4232#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {4232#false} is VALID [2022-02-20 18:49:50,088 INFO L290 TraceCheckUtils]: 92: Hoare triple {4232#false} assume ~r1~0 % 256 < 6;main_~check__tmp~1#1 := 1; {4232#false} is VALID [2022-02-20 18:49:50,088 INFO L290 TraceCheckUtils]: 93: Hoare triple {4232#false} ~__return_105309~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105309~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {4232#false} is VALID [2022-02-20 18:49:50,088 INFO L290 TraceCheckUtils]: 94: Hoare triple {4232#false} assume 0 == main_~assert__arg~1#1 % 256; {4232#false} is VALID [2022-02-20 18:49:50,089 INFO L290 TraceCheckUtils]: 95: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-02-20 18:49:50,090 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:49:50,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:50,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158370648] [2022-02-20 18:49:50,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158370648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:50,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:50,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:49:50,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882552000] [2022-02-20 18:49:50,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:49:50,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:50,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:50,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:50,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:49:50,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:49:50,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:50,185 INFO L87 Difference]: Start difference. First operand 381 states and 572 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:54,507 INFO L93 Difference]: Finished difference Result 1908 states and 2968 transitions. [2022-02-20 18:49:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:49:54,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:49:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1679 transitions. [2022-02-20 18:49:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1679 transitions. [2022-02-20 18:49:54,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1679 transitions. [2022-02-20 18:49:55,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1679 edges. 1679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:56,035 INFO L225 Difference]: With dead ends: 1908 [2022-02-20 18:49:56,036 INFO L226 Difference]: Without dead ends: 1622 [2022-02-20 18:49:56,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:56,039 INFO L933 BasicCegarLoop]: 728 mSDtfsCounter, 2174 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:56,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2174 Valid, 2045 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:49:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-02-20 18:49:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1612. [2022-02-20 18:49:57,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:57,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1622 states. Second operand has 1612 states, 1611 states have (on average 1.5524518932340161) internal successors, (2501), 1611 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,240 INFO L74 IsIncluded]: Start isIncluded. First operand 1622 states. Second operand has 1612 states, 1611 states have (on average 1.5524518932340161) internal successors, (2501), 1611 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,244 INFO L87 Difference]: Start difference. First operand 1622 states. Second operand has 1612 states, 1611 states have (on average 1.5524518932340161) internal successors, (2501), 1611 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:57,366 INFO L93 Difference]: Finished difference Result 1622 states and 2506 transitions. [2022-02-20 18:49:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2506 transitions. [2022-02-20 18:49:57,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:57,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:57,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 1612 states, 1611 states have (on average 1.5524518932340161) internal successors, (2501), 1611 states have internal predecessors, (2501), 0 states have call successors, (0), 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 1622 states. [2022-02-20 18:49:57,376 INFO L87 Difference]: Start difference. First operand has 1612 states, 1611 states have (on average 1.5524518932340161) internal successors, (2501), 1611 states have internal predecessors, (2501), 0 states have call successors, (0), 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 1622 states. [2022-02-20 18:49:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:57,493 INFO L93 Difference]: Finished difference Result 1622 states and 2506 transitions. [2022-02-20 18:49:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2506 transitions. [2022-02-20 18:49:57,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:57,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:57,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:57,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 1.5524518932340161) internal successors, (2501), 1611 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2501 transitions. [2022-02-20 18:49:57,657 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2501 transitions. Word has length 96 [2022-02-20 18:49:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:57,658 INFO L470 AbstractCegarLoop]: Abstraction has 1612 states and 2501 transitions. [2022-02-20 18:49:57,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2501 transitions. [2022-02-20 18:49:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 18:49:57,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:57,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:57,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:49:57,662 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash 372250457, now seen corresponding path program 1 times [2022-02-20 18:49:57,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:57,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452814392] [2022-02-20 18:49:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:57,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {12171#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_104949~0 := 0;~__return_105089~0 := 0;~__return_105309~0 := 0; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {12173#(<= (+ ~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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#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_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {12173#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {12173#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {12174#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:49:57,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {12174#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {12174#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:49:57,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {12174#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id5~0 >= 0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st5~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send5~0 == ~id5~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode5~0 % 256; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id6~0 >= 0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st6~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send6~0 == ~id6~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode6~0 % 256; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id5~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id6~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id5~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id6~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id5~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id6~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 != ~id5~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 != ~id6~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {12175#(<= (+ ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,834 INFO L290 TraceCheckUtils]: 46: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12175#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:57,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {12175#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {12172#false} is VALID [2022-02-20 18:49:57,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {12172#false} ~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); {12172#false} is VALID [2022-02-20 18:49:57,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {12172#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {12172#false} assume !!(0 == ~mode4~0 % 256); {12172#false} is VALID [2022-02-20 18:49:57,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {12172#false} assume !!(0 == ~alive4~0 % 256); {12172#false} is VALID [2022-02-20 18:49:57,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {12172#false} assume !(~send4~0 != ~id4~0); {12172#false} is VALID [2022-02-20 18:49:57,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {12172#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {12172#false} assume !!(0 == ~mode5~0 % 256); {12172#false} is VALID [2022-02-20 18:49:57,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {12172#false} assume !!(0 == ~alive5~0 % 256); {12172#false} is VALID [2022-02-20 18:49:57,849 INFO L290 TraceCheckUtils]: 62: Hoare triple {12172#false} assume !(~send5~0 != ~id5~0); {12172#false} is VALID [2022-02-20 18:49:57,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {12172#false} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,850 INFO L290 TraceCheckUtils]: 64: Hoare triple {12172#false} assume !!(0 == ~mode6~0 % 256); {12172#false} is VALID [2022-02-20 18:49:57,852 INFO L290 TraceCheckUtils]: 65: Hoare triple {12172#false} assume !!(0 == ~alive6~0 % 256); {12172#false} is VALID [2022-02-20 18:49:57,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {12172#false} assume !(~send6~0 != ~id6~0); {12172#false} is VALID [2022-02-20 18:49:57,853 INFO L290 TraceCheckUtils]: 67: Hoare triple {12172#false} ~mode6~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {12172#false} is VALID [2022-02-20 18:49:57,853 INFO L290 TraceCheckUtils]: 68: Hoare triple {12172#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {12172#false} is VALID [2022-02-20 18:49:57,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {12172#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_105089~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105089~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; {12172#false} is VALID [2022-02-20 18:49:57,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {12172#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,853 INFO L290 TraceCheckUtils]: 71: Hoare triple {12172#false} assume !(0 == ~mode1~0 % 256); {12172#false} is VALID [2022-02-20 18:49:57,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {12172#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,854 INFO L290 TraceCheckUtils]: 73: Hoare triple {12172#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {12172#false} is VALID [2022-02-20 18:49:57,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {12172#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {12172#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {12172#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {12172#false} is VALID [2022-02-20 18:49:57,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {12172#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {12172#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,855 INFO L290 TraceCheckUtils]: 79: Hoare triple {12172#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {12172#false} is VALID [2022-02-20 18:49:57,855 INFO L290 TraceCheckUtils]: 80: Hoare triple {12172#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,855 INFO L290 TraceCheckUtils]: 81: Hoare triple {12172#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,855 INFO L290 TraceCheckUtils]: 82: Hoare triple {12172#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {12172#false} is VALID [2022-02-20 18:49:57,855 INFO L290 TraceCheckUtils]: 83: Hoare triple {12172#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,855 INFO L290 TraceCheckUtils]: 84: Hoare triple {12172#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,855 INFO L290 TraceCheckUtils]: 85: Hoare triple {12172#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {12172#false} is VALID [2022-02-20 18:49:57,856 INFO L290 TraceCheckUtils]: 86: Hoare triple {12172#false} ~mode5~0 := 0; {12172#false} is VALID [2022-02-20 18:49:57,856 INFO L290 TraceCheckUtils]: 87: Hoare triple {12172#false} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,856 INFO L290 TraceCheckUtils]: 88: Hoare triple {12172#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12172#false} is VALID [2022-02-20 18:49:57,856 INFO L290 TraceCheckUtils]: 89: Hoare triple {12172#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {12172#false} is VALID [2022-02-20 18:49:57,856 INFO L290 TraceCheckUtils]: 90: Hoare triple {12172#false} ~mode6~0 := 0; {12172#false} is VALID [2022-02-20 18:49:57,856 INFO L290 TraceCheckUtils]: 91: Hoare triple {12172#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {12172#false} is VALID [2022-02-20 18:49:57,857 INFO L290 TraceCheckUtils]: 92: Hoare triple {12172#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {12172#false} is VALID [2022-02-20 18:49:57,857 INFO L290 TraceCheckUtils]: 93: Hoare triple {12172#false} assume ~r1~0 % 256 < 6;main_~check__tmp~1#1 := 1; {12172#false} is VALID [2022-02-20 18:49:57,858 INFO L290 TraceCheckUtils]: 94: Hoare triple {12172#false} ~__return_105309~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105309~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {12172#false} is VALID [2022-02-20 18:49:57,858 INFO L290 TraceCheckUtils]: 95: Hoare triple {12172#false} assume 0 == main_~assert__arg~1#1 % 256; {12172#false} is VALID [2022-02-20 18:49:57,858 INFO L290 TraceCheckUtils]: 96: Hoare triple {12172#false} assume !false; {12172#false} is VALID [2022-02-20 18:49:57,859 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:49:57,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:57,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452814392] [2022-02-20 18:49:57,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452814392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:57,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:57,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:57,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406217183] [2022-02-20 18:49:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:49:57,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:57,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:57,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:57,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:57,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:57,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:57,937 INFO L87 Difference]: Start difference. First operand 1612 states and 2501 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:02,697 INFO L93 Difference]: Finished difference Result 4340 states and 6808 transitions. [2022-02-20 18:50:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:02,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:50:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2022-02-20 18:50:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2022-02-20 18:50:02,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 833 transitions. [2022-02-20 18:50:03,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 833 edges. 833 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:03,613 INFO L225 Difference]: With dead ends: 4340 [2022-02-20 18:50:03,613 INFO L226 Difference]: Without dead ends: 2814 [2022-02-20 18:50:03,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:03,617 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 1366 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:03,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 346 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2022-02-20 18:50:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 2812. [2022-02-20 18:50:06,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:06,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2814 states. Second operand has 2812 states, 2811 states have (on average 1.5613660618996799) internal successors, (4389), 2811 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:06,828 INFO L74 IsIncluded]: Start isIncluded. First operand 2814 states. Second operand has 2812 states, 2811 states have (on average 1.5613660618996799) internal successors, (4389), 2811 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:06,833 INFO L87 Difference]: Start difference. First operand 2814 states. Second operand has 2812 states, 2811 states have (on average 1.5613660618996799) internal successors, (4389), 2811 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:07,055 INFO L93 Difference]: Finished difference Result 2814 states and 4390 transitions. [2022-02-20 18:50:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 4390 transitions. [2022-02-20 18:50:07,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:07,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:07,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 2812 states, 2811 states have (on average 1.5613660618996799) internal successors, (4389), 2811 states have internal predecessors, (4389), 0 states have call successors, (0), 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 2814 states. [2022-02-20 18:50:07,069 INFO L87 Difference]: Start difference. First operand has 2812 states, 2811 states have (on average 1.5613660618996799) internal successors, (4389), 2811 states have internal predecessors, (4389), 0 states have call successors, (0), 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 2814 states. [2022-02-20 18:50:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:07,282 INFO L93 Difference]: Finished difference Result 2814 states and 4390 transitions. [2022-02-20 18:50:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 4390 transitions. [2022-02-20 18:50:07,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:07,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:07,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:07,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 1.5613660618996799) internal successors, (4389), 2811 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4389 transitions. [2022-02-20 18:50:07,593 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4389 transitions. Word has length 97 [2022-02-20 18:50:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:07,593 INFO L470 AbstractCegarLoop]: Abstraction has 2812 states and 4389 transitions. [2022-02-20 18:50:07,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4389 transitions. [2022-02-20 18:50:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 18:50:07,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:07,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:07,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:07,596 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1864730935, now seen corresponding path program 1 times [2022-02-20 18:50:07,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:07,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13918493] [2022-02-20 18:50:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:07,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {27466#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_104949~0 := 0;~__return_105089~0 := 0;~__return_105309~0 := 0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {27468#(<= (+ ~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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#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_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {27468#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:07,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {27468#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {27469#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:50:07,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {27469#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {27469#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:50:07,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {27469#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id6~0 >= 0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~st6~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~send6~0 == ~id6~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode6~0 % 256; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id6~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id6~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id6~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id6~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive1~0 % 256); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive2~0 % 256); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~id2~0); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive3~0 % 256); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~id3~0); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,697 INFO L290 TraceCheckUtils]: 54: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive4~0 % 256); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send4~0 != ~id4~0); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256); {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,699 INFO L290 TraceCheckUtils]: 60: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(0 == ~alive5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {27470#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:50:07,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {27470#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {27467#false} is VALID [2022-02-20 18:50:07,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {27467#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256); {27467#false} is VALID [2022-02-20 18:50:07,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {27467#false} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,700 INFO L290 TraceCheckUtils]: 64: Hoare triple {27467#false} assume !!(0 == ~mode6~0 % 256); {27467#false} is VALID [2022-02-20 18:50:07,700 INFO L290 TraceCheckUtils]: 65: Hoare triple {27467#false} assume !!(0 == ~alive6~0 % 256); {27467#false} is VALID [2022-02-20 18:50:07,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {27467#false} assume !(~send6~0 != ~id6~0); {27467#false} is VALID [2022-02-20 18:50:07,701 INFO L290 TraceCheckUtils]: 67: Hoare triple {27467#false} ~mode6~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {27467#false} is VALID [2022-02-20 18:50:07,701 INFO L290 TraceCheckUtils]: 68: Hoare triple {27467#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {27467#false} is VALID [2022-02-20 18:50:07,701 INFO L290 TraceCheckUtils]: 69: Hoare triple {27467#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_105089~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105089~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; {27467#false} is VALID [2022-02-20 18:50:07,701 INFO L290 TraceCheckUtils]: 70: Hoare triple {27467#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {27467#false} assume !(0 == ~mode1~0 % 256); {27467#false} is VALID [2022-02-20 18:50:07,701 INFO L290 TraceCheckUtils]: 72: Hoare triple {27467#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,702 INFO L290 TraceCheckUtils]: 73: Hoare triple {27467#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {27467#false} is VALID [2022-02-20 18:50:07,702 INFO L290 TraceCheckUtils]: 74: Hoare triple {27467#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,702 INFO L290 TraceCheckUtils]: 75: Hoare triple {27467#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,702 INFO L290 TraceCheckUtils]: 76: Hoare triple {27467#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {27467#false} is VALID [2022-02-20 18:50:07,702 INFO L290 TraceCheckUtils]: 77: Hoare triple {27467#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,702 INFO L290 TraceCheckUtils]: 78: Hoare triple {27467#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,703 INFO L290 TraceCheckUtils]: 79: Hoare triple {27467#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {27467#false} is VALID [2022-02-20 18:50:07,703 INFO L290 TraceCheckUtils]: 80: Hoare triple {27467#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,703 INFO L290 TraceCheckUtils]: 81: Hoare triple {27467#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,703 INFO L290 TraceCheckUtils]: 82: Hoare triple {27467#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {27467#false} is VALID [2022-02-20 18:50:07,703 INFO L290 TraceCheckUtils]: 83: Hoare triple {27467#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,703 INFO L290 TraceCheckUtils]: 84: Hoare triple {27467#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,704 INFO L290 TraceCheckUtils]: 85: Hoare triple {27467#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {27467#false} is VALID [2022-02-20 18:50:07,704 INFO L290 TraceCheckUtils]: 86: Hoare triple {27467#false} ~mode5~0 := 0; {27467#false} is VALID [2022-02-20 18:50:07,704 INFO L290 TraceCheckUtils]: 87: Hoare triple {27467#false} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,704 INFO L290 TraceCheckUtils]: 88: Hoare triple {27467#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {27467#false} is VALID [2022-02-20 18:50:07,704 INFO L290 TraceCheckUtils]: 89: Hoare triple {27467#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {27467#false} is VALID [2022-02-20 18:50:07,704 INFO L290 TraceCheckUtils]: 90: Hoare triple {27467#false} ~mode6~0 := 0; {27467#false} is VALID [2022-02-20 18:50:07,704 INFO L290 TraceCheckUtils]: 91: Hoare triple {27467#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {27467#false} is VALID [2022-02-20 18:50:07,705 INFO L290 TraceCheckUtils]: 92: Hoare triple {27467#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {27467#false} is VALID [2022-02-20 18:50:07,705 INFO L290 TraceCheckUtils]: 93: Hoare triple {27467#false} assume ~r1~0 % 256 < 6;main_~check__tmp~1#1 := 1; {27467#false} is VALID [2022-02-20 18:50:07,705 INFO L290 TraceCheckUtils]: 94: Hoare triple {27467#false} ~__return_105309~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105309~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {27467#false} is VALID [2022-02-20 18:50:07,705 INFO L290 TraceCheckUtils]: 95: Hoare triple {27467#false} assume 0 == main_~assert__arg~1#1 % 256; {27467#false} is VALID [2022-02-20 18:50:07,705 INFO L290 TraceCheckUtils]: 96: Hoare triple {27467#false} assume !false; {27467#false} is VALID [2022-02-20 18:50:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:07,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:07,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13918493] [2022-02-20 18:50:07,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13918493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:07,707 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:07,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:07,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725418673] [2022-02-20 18:50:07,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:07,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:50:07,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:07,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:07,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:07,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:07,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:07,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:07,796 INFO L87 Difference]: Start difference. First operand 2812 states and 4389 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:17,890 INFO L93 Difference]: Finished difference Result 7671 states and 12062 transitions. [2022-02-20 18:50:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:17,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:50:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 783 transitions. [2022-02-20 18:50:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 783 transitions. [2022-02-20 18:50:17,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 783 transitions. [2022-02-20 18:50:18,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 783 edges. 783 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:19,359 INFO L225 Difference]: With dead ends: 7671 [2022-02-20 18:50:19,359 INFO L226 Difference]: Without dead ends: 5012 [2022-02-20 18:50:19,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:19,373 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 1296 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:19,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1296 Valid, 350 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5012 states. [2022-02-20 18:50:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5012 to 5010. [2022-02-20 18:50:26,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:26,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5012 states. Second operand has 5010 states, 5009 states have (on average 1.5641844679576762) internal successors, (7835), 5009 states have internal predecessors, (7835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:26,480 INFO L74 IsIncluded]: Start isIncluded. First operand 5012 states. Second operand has 5010 states, 5009 states have (on average 1.5641844679576762) internal successors, (7835), 5009 states have internal predecessors, (7835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:26,485 INFO L87 Difference]: Start difference. First operand 5012 states. Second operand has 5010 states, 5009 states have (on average 1.5641844679576762) internal successors, (7835), 5009 states have internal predecessors, (7835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:27,181 INFO L93 Difference]: Finished difference Result 5012 states and 7836 transitions. [2022-02-20 18:50:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 7836 transitions. [2022-02-20 18:50:27,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:27,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:27,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 5010 states, 5009 states have (on average 1.5641844679576762) internal successors, (7835), 5009 states have internal predecessors, (7835), 0 states have call successors, (0), 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 5012 states. [2022-02-20 18:50:27,205 INFO L87 Difference]: Start difference. First operand has 5010 states, 5009 states have (on average 1.5641844679576762) internal successors, (7835), 5009 states have internal predecessors, (7835), 0 states have call successors, (0), 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 5012 states. [2022-02-20 18:50:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:27,882 INFO L93 Difference]: Finished difference Result 5012 states and 7836 transitions. [2022-02-20 18:50:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 7836 transitions. [2022-02-20 18:50:27,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:27,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:27,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:27,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5010 states, 5009 states have (on average 1.5641844679576762) internal successors, (7835), 5009 states have internal predecessors, (7835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 7835 transitions. [2022-02-20 18:50:28,875 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 7835 transitions. Word has length 97 [2022-02-20 18:50:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:28,875 INFO L470 AbstractCegarLoop]: Abstraction has 5010 states and 7835 transitions. [2022-02-20 18:50:28,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 7835 transitions. [2022-02-20 18:50:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 18:50:28,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:28,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:28,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:28,878 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash -196878970, now seen corresponding path program 1 times [2022-02-20 18:50:28,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:28,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545610979] [2022-02-20 18:50:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:28,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:28,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {54854#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_104949~0 := 0;~__return_105089~0 := 0;~__return_105309~0 := 0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {54856#(<= (+ ~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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#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_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st5~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~send5~0 == ~id5~0; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode5~0 % 256; {54856#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:28,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {54856#(<= (+ ~nomsg~0 1) 0)} assume ~id6~0 >= 0; {54857#(<= (+ ~nomsg~0 1) ~id6~0)} is VALID [2022-02-20 18:50:28,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {54857#(<= (+ ~nomsg~0 1) ~id6~0)} assume 0 == ~st6~0; {54857#(<= (+ ~nomsg~0 1) ~id6~0)} is VALID [2022-02-20 18:50:28,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {54857#(<= (+ ~nomsg~0 1) ~id6~0)} assume ~send6~0 == ~id6~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume 0 == ~mode6~0 % 256; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id2~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id3~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id4~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id5~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id6~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id3~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id4~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id5~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id6~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id3~0 != ~id4~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id3~0 != ~id5~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id3~0 != ~id6~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id4~0 != ~id5~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:28,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id4~0 != ~id6~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode1~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,001 INFO L290 TraceCheckUtils]: 45: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive1~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,001 INFO L290 TraceCheckUtils]: 47: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode2~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive2~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send2~0 != ~id2~0); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,003 INFO L290 TraceCheckUtils]: 50: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,004 INFO L290 TraceCheckUtils]: 51: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode3~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,004 INFO L290 TraceCheckUtils]: 52: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive3~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send3~0 != ~id3~0); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,005 INFO L290 TraceCheckUtils]: 54: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,005 INFO L290 TraceCheckUtils]: 55: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode4~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive4~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send4~0 != ~id4~0); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode5~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive5~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send5~0 != ~id5~0); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode6~0 % 256); {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,009 INFO L290 TraceCheckUtils]: 64: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(0 == ~alive6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {54858#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:29,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {54858#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send6~0 != ~nomsg~0);main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {54855#false} is VALID [2022-02-20 18:50:29,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {54855#false} ~p6_new~0 := (if main_~node6____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node6____CPAchecker_TMP_0~0#1 % 256 else main_~node6____CPAchecker_TMP_0~0#1 % 256 - 256); {54855#false} is VALID [2022-02-20 18:50:29,010 INFO L290 TraceCheckUtils]: 67: Hoare triple {54855#false} ~mode6~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {54855#false} is VALID [2022-02-20 18:50:29,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {54855#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {54855#false} is VALID [2022-02-20 18:50:29,010 INFO L290 TraceCheckUtils]: 69: Hoare triple {54855#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_105089~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105089~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; {54855#false} is VALID [2022-02-20 18:50:29,010 INFO L290 TraceCheckUtils]: 70: Hoare triple {54855#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,010 INFO L290 TraceCheckUtils]: 71: Hoare triple {54855#false} assume !(0 == ~mode1~0 % 256); {54855#false} is VALID [2022-02-20 18:50:29,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {54855#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {54855#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {54855#false} is VALID [2022-02-20 18:50:29,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {54855#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {54855#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {54855#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {54855#false} is VALID [2022-02-20 18:50:29,012 INFO L290 TraceCheckUtils]: 77: Hoare triple {54855#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,012 INFO L290 TraceCheckUtils]: 78: Hoare triple {54855#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,012 INFO L290 TraceCheckUtils]: 79: Hoare triple {54855#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {54855#false} is VALID [2022-02-20 18:50:29,012 INFO L290 TraceCheckUtils]: 80: Hoare triple {54855#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,012 INFO L290 TraceCheckUtils]: 81: Hoare triple {54855#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,012 INFO L290 TraceCheckUtils]: 82: Hoare triple {54855#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {54855#false} is VALID [2022-02-20 18:50:29,013 INFO L290 TraceCheckUtils]: 83: Hoare triple {54855#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,013 INFO L290 TraceCheckUtils]: 84: Hoare triple {54855#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,013 INFO L290 TraceCheckUtils]: 85: Hoare triple {54855#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {54855#false} is VALID [2022-02-20 18:50:29,013 INFO L290 TraceCheckUtils]: 86: Hoare triple {54855#false} ~mode5~0 := 0; {54855#false} is VALID [2022-02-20 18:50:29,013 INFO L290 TraceCheckUtils]: 87: Hoare triple {54855#false} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,013 INFO L290 TraceCheckUtils]: 88: Hoare triple {54855#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {54855#false} is VALID [2022-02-20 18:50:29,014 INFO L290 TraceCheckUtils]: 89: Hoare triple {54855#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {54855#false} is VALID [2022-02-20 18:50:29,014 INFO L290 TraceCheckUtils]: 90: Hoare triple {54855#false} ~mode6~0 := 0; {54855#false} is VALID [2022-02-20 18:50:29,014 INFO L290 TraceCheckUtils]: 91: Hoare triple {54855#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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {54855#false} is VALID [2022-02-20 18:50:29,014 INFO L290 TraceCheckUtils]: 92: Hoare triple {54855#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {54855#false} is VALID [2022-02-20 18:50:29,014 INFO L290 TraceCheckUtils]: 93: Hoare triple {54855#false} assume ~r1~0 % 256 < 6;main_~check__tmp~1#1 := 1; {54855#false} is VALID [2022-02-20 18:50:29,015 INFO L290 TraceCheckUtils]: 94: Hoare triple {54855#false} ~__return_105309~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105309~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {54855#false} is VALID [2022-02-20 18:50:29,015 INFO L290 TraceCheckUtils]: 95: Hoare triple {54855#false} assume 0 == main_~assert__arg~1#1 % 256; {54855#false} is VALID [2022-02-20 18:50:29,015 INFO L290 TraceCheckUtils]: 96: Hoare triple {54855#false} assume !false; {54855#false} is VALID [2022-02-20 18:50:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:29,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:29,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545610979] [2022-02-20 18:50:29,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545610979] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:29,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:29,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:29,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474917200] [2022-02-20 18:50:29,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:29,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:50:29,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:29,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:29,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:29,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:29,087 INFO L87 Difference]: Start difference. First operand 5010 states and 7835 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)