./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.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.5.1.ufo.BOUNDED-10.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 e7bf678f67bc088f549a4abb07f450d970cef489f8318e3fb7c3771679b9e87b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:52:47,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:52:47,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:52:47,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:52:47,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:52:47,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:52:47,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:52:47,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:52:47,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:52:47,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:52:47,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:52:47,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:52:47,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:52:47,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:52:47,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:52:47,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:52:47,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:52:47,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:52:47,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:52:47,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:52:47,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:52:47,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:52:47,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:52:47,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:52:47,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:52:47,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:52:47,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:52:47,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:52:47,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:52:47,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:52:47,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:52:47,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:52:47,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:52:47,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:52:47,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:52:47,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:52:47,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:52:47,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:52:47,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:52:47,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:52:47,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:52:47,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:52:47,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:52:47,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:52:47,905 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:52:47,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:52:47,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:52:47,906 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:52:47,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:52:47,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:52:47,907 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:52:47,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:52:47,908 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:52:47,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:52:47,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:52:47,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:52:47,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:52:47,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:52:47,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:52:47,909 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:52:47,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:52:47,910 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:52:47,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:52:47,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:52:47,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:52:47,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:52:47,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:47,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:52:47,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:52:47,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:52:47,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:52:47,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:52:47,912 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:52:47,912 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:52:47,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:52:47,913 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 -> e7bf678f67bc088f549a4abb07f450d970cef489f8318e3fb7c3771679b9e87b [2022-02-20 18:52:48,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:52:48,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:52:48,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:52:48,224 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:52:48,224 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:52:48,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:52:48,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f815f44b2/1ed0b35b642d4e408dd341d14e6cead3/FLAG926380d72 [2022-02-20 18:52:48,730 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:52:48,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:52:48,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f815f44b2/1ed0b35b642d4e408dd341d14e6cead3/FLAG926380d72 [2022-02-20 18:52:49,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f815f44b2/1ed0b35b642d4e408dd341d14e6cead3 [2022-02-20 18:52:49,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:52:49,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:52:49,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:49,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:52:49,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:52:49,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b631a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49, skipping insertion in model container [2022-02-20 18:52:49,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:52:49,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:52:49,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7981,7994] [2022-02-20 18:52:49,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:49,480 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:52:49,547 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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7981,7994] [2022-02-20 18:52:49,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:49,623 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:52:49,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49 WrapperNode [2022-02-20 18:52:49,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:49,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:49,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:52:49,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:52:49,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,712 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 631 [2022-02-20 18:52:49,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:49,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:52:49,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:52:49,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:52:49,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:52:49,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:52:49,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:52:49,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:52:49,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (1/1) ... [2022-02-20 18:52:49,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:52:49,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:52:49,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:52:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:52:49,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:52:49,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:52:49,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:52:49,975 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:52:49,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:52:50,729 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:52:50,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:52:50,739 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:52:50,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:50 BoogieIcfgContainer [2022-02-20 18:52:50,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:52:50,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:52:50,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:52:50,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:52:50,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:52:49" (1/3) ... [2022-02-20 18:52:50,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f66b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:50, skipping insertion in model container [2022-02-20 18:52:50,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:49" (2/3) ... [2022-02-20 18:52:50,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f66b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:50, skipping insertion in model container [2022-02-20 18:52:50,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:50" (3/3) ... [2022-02-20 18:52:50,748 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:52:50,753 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:52:50,753 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:52:50,786 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:52:50,790 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:52:50,791 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:52:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:52:50,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:50,818 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] [2022-02-20 18:52:50,818 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:50,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash -95572409, now seen corresponding path program 1 times [2022-02-20 18:52:50,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:50,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823801216] [2022-02-20 18:52:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:51,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~__return_6229~0 := 0;~__return_6338~0 := 0;~__tmp_6517_0~0 := 0;~__return_6535~0 := 0;~__return_6446~0 := 0; {153#true} is VALID [2022-02-20 18:52:51,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {153#true} is VALID [2022-02-20 18:52:51,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#true} assume 0 == ~r1~0; {153#true} is VALID [2022-02-20 18:52:51,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {153#true} assume ~id1~0 >= 0; {153#true} is VALID [2022-02-20 18:52:51,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#true} assume 0 == ~st1~0; {155#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:51,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {155#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {155#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:51,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {155#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {155#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:51,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(<= ~st1~0 0)} assume ~id2~0 >= 0; {155#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:51,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#(<= ~st1~0 0)} assume 0 == ~st2~0; {156#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {156#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {156#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {156#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {156#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {157#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {158#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,289 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,289 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode5~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;havoc main_~check__tmp~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6338~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; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,298 INFO L290 TraceCheckUtils]: 54: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,298 INFO L290 TraceCheckUtils]: 55: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,300 INFO L290 TraceCheckUtils]: 57: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,302 INFO L290 TraceCheckUtils]: 59: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,302 INFO L290 TraceCheckUtils]: 60: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,305 INFO L290 TraceCheckUtils]: 63: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,308 INFO L290 TraceCheckUtils]: 67: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,309 INFO L290 TraceCheckUtils]: 69: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 0;~__tmp_6517_0~0 := main_~main____CPAchecker_TMP_0~0#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6517_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;havoc main_~check__tmp~1#1; {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:51,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {159#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {154#false} is VALID [2022-02-20 18:52:51,312 INFO L290 TraceCheckUtils]: 73: Hoare triple {154#false} ~__return_6535~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6535~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; {154#false} is VALID [2022-02-20 18:52:51,312 INFO L290 TraceCheckUtils]: 74: Hoare triple {154#false} assume 0 == main_~assert__arg~1#1 % 256; {154#false} is VALID [2022-02-20 18:52:51,312 INFO L290 TraceCheckUtils]: 75: Hoare triple {154#false} assume !false; {154#false} is VALID [2022-02-20 18:52:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:51,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:51,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823801216] [2022-02-20 18:52:51,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823801216] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:51,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:51,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:52:51,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132524545] [2022-02-20 18:52:51,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:51,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:52:51,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:51,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:51,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:51,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:52:51,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:51,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:52:51,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:51,452 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:53,901 INFO L93 Difference]: Finished difference Result 845 states and 1355 transitions. [2022-02-20 18:52:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:52:53,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:52:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1355 transitions. [2022-02-20 18:52:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1355 transitions. [2022-02-20 18:52:53,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1355 transitions. [2022-02-20 18:52:54,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1355 edges. 1355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:55,067 INFO L225 Difference]: With dead ends: 845 [2022-02-20 18:52:55,068 INFO L226 Difference]: Without dead ends: 751 [2022-02-20 18:52:55,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:52:55,074 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 1636 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:55,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1636 Valid, 1886 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:52:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-02-20 18:52:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 227. [2022-02-20 18:52:55,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:55,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 751 states. Second operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,233 INFO L74 IsIncluded]: Start isIncluded. First operand 751 states. Second operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,233 INFO L87 Difference]: Start difference. First operand 751 states. Second operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:55,270 INFO L93 Difference]: Finished difference Result 751 states and 1141 transitions. [2022-02-20 18:52:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1141 transitions. [2022-02-20 18:52:55,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:55,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:55,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 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 751 states. [2022-02-20 18:52:55,276 INFO L87 Difference]: Start difference. First operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 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 751 states. [2022-02-20 18:52:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:55,312 INFO L93 Difference]: Finished difference Result 751 states and 1141 transitions. [2022-02-20 18:52:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1141 transitions. [2022-02-20 18:52:55,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:55,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:55,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:55,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2022-02-20 18:52:55,323 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 76 [2022-02-20 18:52:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:55,324 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2022-02-20 18:52:55,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2022-02-20 18:52:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:52:55,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:55,326 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] [2022-02-20 18:52:55,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:52:55,327 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash -136563640, now seen corresponding path program 1 times [2022-02-20 18:52:55,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:55,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413160380] [2022-02-20 18:52:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:55,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:55,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {3101#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~__return_6229~0 := 0;~__return_6338~0 := 0;~__tmp_6517_0~0 := 0;~__return_6535~0 := 0;~__return_6446~0 := 0; {3101#true} is VALID [2022-02-20 18:52:55,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {3101#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {3101#true} is VALID [2022-02-20 18:52:55,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {3101#true} assume 0 == ~r1~0; {3101#true} is VALID [2022-02-20 18:52:55,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {3101#true} assume ~id1~0 >= 0; {3101#true} is VALID [2022-02-20 18:52:55,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {3101#true} assume 0 == ~st1~0; {3103#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:55,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {3103#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {3103#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:55,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {3103#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {3103#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:55,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {3103#(<= ~st1~0 0)} assume ~id2~0 >= 0; {3103#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:55,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {3103#(<= ~st1~0 0)} assume 0 == ~st2~0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {3104#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {3104#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {3105#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,536 INFO L290 TraceCheckUtils]: 48: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~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);~mode5~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;havoc main_~check__tmp~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6338~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; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,539 INFO L290 TraceCheckUtils]: 54: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,539 INFO L290 TraceCheckUtils]: 55: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,541 INFO L290 TraceCheckUtils]: 57: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,545 INFO L290 TraceCheckUtils]: 61: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,546 INFO L290 TraceCheckUtils]: 62: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,546 INFO L290 TraceCheckUtils]: 63: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,547 INFO L290 TraceCheckUtils]: 64: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:55,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {3106#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:55,548 INFO L290 TraceCheckUtils]: 66: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:55,549 INFO L290 TraceCheckUtils]: 67: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:55,551 INFO L290 TraceCheckUtils]: 68: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:55,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:55,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:55,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:55,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode5~0 := 0;~__tmp_6517_0~0 := main_~main____CPAchecker_TMP_0~0#1; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:55,554 INFO L290 TraceCheckUtils]: 73: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6517_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;havoc main_~check__tmp~1#1; {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:55,554 INFO L290 TraceCheckUtils]: 74: Hoare triple {3107#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {3102#false} is VALID [2022-02-20 18:52:55,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {3102#false} ~__return_6535~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6535~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; {3102#false} is VALID [2022-02-20 18:52:55,555 INFO L290 TraceCheckUtils]: 76: Hoare triple {3102#false} assume 0 == main_~assert__arg~1#1 % 256; {3102#false} is VALID [2022-02-20 18:52:55,555 INFO L290 TraceCheckUtils]: 77: Hoare triple {3102#false} assume !false; {3102#false} is VALID [2022-02-20 18:52:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:55,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:55,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413160380] [2022-02-20 18:52:55,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413160380] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:55,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:55,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:52:55,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406961744] [2022-02-20 18:52:55,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:55,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:52:55,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:55,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:55,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:55,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:52:55,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:55,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:52:55,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:55,629 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:57,321 INFO L93 Difference]: Finished difference Result 922 states and 1419 transitions. [2022-02-20 18:52:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:52:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:52:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-02-20 18:52:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-02-20 18:52:57,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 861 transitions. [2022-02-20 18:52:57,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 861 edges. 861 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:58,008 INFO L225 Difference]: With dead ends: 922 [2022-02-20 18:52:58,008 INFO L226 Difference]: Without dead ends: 802 [2022-02-20 18:52:58,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:58,010 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 1026 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:58,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 1146 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-02-20 18:52:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 356. [2022-02-20 18:52:58,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:58,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 802 states. Second operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,269 INFO L74 IsIncluded]: Start isIncluded. First operand 802 states. Second operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,270 INFO L87 Difference]: Start difference. First operand 802 states. Second operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:58,304 INFO L93 Difference]: Finished difference Result 802 states and 1229 transitions. [2022-02-20 18:52:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1229 transitions. [2022-02-20 18:52:58,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:58,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:58,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 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 802 states. [2022-02-20 18:52:58,308 INFO L87 Difference]: Start difference. First operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 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 802 states. [2022-02-20 18:52:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:58,343 INFO L93 Difference]: Finished difference Result 802 states and 1229 transitions. [2022-02-20 18:52:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1229 transitions. [2022-02-20 18:52:58,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:58,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:58,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:58,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 532 transitions. [2022-02-20 18:52:58,356 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 532 transitions. Word has length 78 [2022-02-20 18:52:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:58,356 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 532 transitions. [2022-02-20 18:52:58,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 532 transitions. [2022-02-20 18:52:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:52:58,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:58,358 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] [2022-02-20 18:52:58,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:52:58,358 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1646592496, now seen corresponding path program 1 times [2022-02-20 18:52:58,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:58,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385928345] [2022-02-20 18:52:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:58,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {6435#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~__return_6229~0 := 0;~__return_6338~0 := 0;~__tmp_6517_0~0 := 0;~__return_6535~0 := 0;~__return_6446~0 := 0; {6435#true} is VALID [2022-02-20 18:52:58,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {6435#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {6435#true} is VALID [2022-02-20 18:52:58,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {6435#true} assume 0 == ~r1~0; {6435#true} is VALID [2022-02-20 18:52:58,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {6435#true} assume ~id1~0 >= 0; {6435#true} is VALID [2022-02-20 18:52:58,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {6435#true} assume 0 == ~st1~0; {6437#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:58,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {6437#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {6437#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:58,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {6437#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {6437#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:58,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {6437#(<= ~st1~0 0)} assume ~id2~0 >= 0; {6437#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:58,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {6437#(<= ~st1~0 0)} assume 0 == ~st2~0; {6438#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {6438#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {6438#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {6438#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6438#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {6438#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {6438#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {6438#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {6439#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,536 INFO L290 TraceCheckUtils]: 48: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode5~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;havoc main_~check__tmp~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6338~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; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,539 INFO L290 TraceCheckUtils]: 54: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,539 INFO L290 TraceCheckUtils]: 55: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,541 INFO L290 TraceCheckUtils]: 59: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,542 INFO L290 TraceCheckUtils]: 61: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,543 INFO L290 TraceCheckUtils]: 62: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,543 INFO L290 TraceCheckUtils]: 63: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,544 INFO L290 TraceCheckUtils]: 64: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,544 INFO L290 TraceCheckUtils]: 65: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,545 INFO L290 TraceCheckUtils]: 66: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 != ~nomsg~0; {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,545 INFO L290 TraceCheckUtils]: 67: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 > ~id4~0); {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:58,546 INFO L290 TraceCheckUtils]: 68: Hoare triple {6440#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:58,546 INFO L290 TraceCheckUtils]: 69: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:58,547 INFO L290 TraceCheckUtils]: 70: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:58,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:58,548 INFO L290 TraceCheckUtils]: 72: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode5~0 := 0;~__tmp_6517_0~0 := main_~main____CPAchecker_TMP_0~0#1; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:58,548 INFO L290 TraceCheckUtils]: 73: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6517_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;havoc main_~check__tmp~1#1; {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:58,549 INFO L290 TraceCheckUtils]: 74: Hoare triple {6441#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {6436#false} is VALID [2022-02-20 18:52:58,549 INFO L290 TraceCheckUtils]: 75: Hoare triple {6436#false} ~__return_6535~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6535~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; {6436#false} is VALID [2022-02-20 18:52:58,549 INFO L290 TraceCheckUtils]: 76: Hoare triple {6436#false} assume 0 == main_~assert__arg~1#1 % 256; {6436#false} is VALID [2022-02-20 18:52:58,550 INFO L290 TraceCheckUtils]: 77: Hoare triple {6436#false} assume !false; {6436#false} is VALID [2022-02-20 18:52:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:58,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:58,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385928345] [2022-02-20 18:52:58,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385928345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:58,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:58,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:52:58,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71892466] [2022-02-20 18:52:58,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:58,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:52:58,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:58,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:58,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:52:58,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:58,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:52:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:58,613 INFO L87 Difference]: Start difference. First operand 356 states and 532 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:00,458 INFO L93 Difference]: Finished difference Result 1046 states and 1615 transitions. [2022-02-20 18:53:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:00,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-02-20 18:53:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-02-20 18:53:00,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 861 transitions. [2022-02-20 18:53:01,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 861 edges. 861 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:01,131 INFO L225 Difference]: With dead ends: 1046 [2022-02-20 18:53:01,132 INFO L226 Difference]: Without dead ends: 926 [2022-02-20 18:53:01,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:01,134 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 1288 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:01,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1288 Valid, 1050 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-02-20 18:53:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 539. [2022-02-20 18:53:01,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:01,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 926 states. Second operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:01,628 INFO L74 IsIncluded]: Start isIncluded. First operand 926 states. Second operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:01,629 INFO L87 Difference]: Start difference. First operand 926 states. Second operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:01,672 INFO L93 Difference]: Finished difference Result 926 states and 1425 transitions. [2022-02-20 18:53:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1425 transitions. [2022-02-20 18:53:01,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:01,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:01,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 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 926 states. [2022-02-20 18:53:01,677 INFO L87 Difference]: Start difference. First operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 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 926 states. [2022-02-20 18:53:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:01,720 INFO L93 Difference]: Finished difference Result 926 states and 1425 transitions. [2022-02-20 18:53:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1425 transitions. [2022-02-20 18:53:01,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:01,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:01,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:01,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 821 transitions. [2022-02-20 18:53:01,743 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 821 transitions. Word has length 78 [2022-02-20 18:53:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:01,744 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 821 transitions. [2022-02-20 18:53:01,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 821 transitions. [2022-02-20 18:53:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:01,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:01,746 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] [2022-02-20 18:53:01,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:53:01,747 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash 641558373, now seen corresponding path program 1 times [2022-02-20 18:53:01,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:01,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110047914] [2022-02-20 18:53:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:02,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {10443#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~__return_6229~0 := 0;~__return_6338~0 := 0;~__tmp_6517_0~0 := 0;~__return_6535~0 := 0;~__return_6446~0 := 0; {10443#true} is VALID [2022-02-20 18:53:02,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {10443#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {10443#true} is VALID [2022-02-20 18:53:02,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {10443#true} assume 0 == ~r1~0; {10443#true} is VALID [2022-02-20 18:53:02,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {10443#true} assume ~id1~0 >= 0; {10443#true} is VALID [2022-02-20 18:53:02,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {10443#true} assume 0 == ~st1~0; {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:02,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:02,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:02,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:02,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {10445#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:02,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:02,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:02,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:02,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {10446#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:02,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:02,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:02,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:02,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {10447#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:02,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:02,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:02,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:02,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {10448#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,083 INFO L290 TraceCheckUtils]: 44: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,083 INFO L290 TraceCheckUtils]: 45: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,084 INFO L290 TraceCheckUtils]: 47: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~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);~mode5~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;havoc main_~check__tmp~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 5); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,088 INFO L290 TraceCheckUtils]: 53: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6338~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; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,088 INFO L290 TraceCheckUtils]: 54: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,089 INFO L290 TraceCheckUtils]: 55: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,092 INFO L290 TraceCheckUtils]: 60: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,096 INFO L290 TraceCheckUtils]: 67: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode5~0 := 0;~__tmp_6517_0~0 := main_~main____CPAchecker_TMP_0~0#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6517_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;havoc main_~check__tmp~1#1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,100 INFO L290 TraceCheckUtils]: 73: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 5); {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:02,100 INFO L290 TraceCheckUtils]: 74: Hoare triple {10449#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);main_~check__tmp~1#1 := 0; {10444#false} is VALID [2022-02-20 18:53:02,101 INFO L290 TraceCheckUtils]: 75: Hoare triple {10444#false} ~__return_6535~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6535~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; {10444#false} is VALID [2022-02-20 18:53:02,101 INFO L290 TraceCheckUtils]: 76: Hoare triple {10444#false} assume 0 == main_~assert__arg~1#1 % 256; {10444#false} is VALID [2022-02-20 18:53:02,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {10444#false} assume !false; {10444#false} is VALID [2022-02-20 18:53:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:02,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:02,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110047914] [2022-02-20 18:53:02,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110047914] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:02,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:02,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:02,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992715768] [2022-02-20 18:53:02,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:02,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:02,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:02,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:02,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:02,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:02,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:02,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:02,176 INFO L87 Difference]: Start difference. First operand 539 states and 821 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:03,577 INFO L93 Difference]: Finished difference Result 956 states and 1478 transitions. [2022-02-20 18:53:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 425 transitions. [2022-02-20 18:53:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 425 transitions. [2022-02-20 18:53:03,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 425 transitions. [2022-02-20 18:53:03,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:03,894 INFO L225 Difference]: With dead ends: 956 [2022-02-20 18:53:03,894 INFO L226 Difference]: Without dead ends: 541 [2022-02-20 18:53:03,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:53:03,905 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 700 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:03,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 678 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-02-20 18:53:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2022-02-20 18:53:04,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:04,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 541 states. Second operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:04,464 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:04,465 INFO L87 Difference]: Start difference. First operand 541 states. Second operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:04,481 INFO L93 Difference]: Finished difference Result 541 states and 818 transitions. [2022-02-20 18:53:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 818 transitions. [2022-02-20 18:53:04,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:04,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:04,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 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 541 states. [2022-02-20 18:53:04,484 INFO L87 Difference]: Start difference. First operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 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 541 states. [2022-02-20 18:53:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:04,500 INFO L93 Difference]: Finished difference Result 541 states and 818 transitions. [2022-02-20 18:53:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 818 transitions. [2022-02-20 18:53:04,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:04,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:04,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:04,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 817 transitions. [2022-02-20 18:53:04,522 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 817 transitions. Word has length 78 [2022-02-20 18:53:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:04,522 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 817 transitions. [2022-02-20 18:53:04,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 817 transitions. [2022-02-20 18:53:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:04,524 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:04,524 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] [2022-02-20 18:53:04,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:53:04,526 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:04,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:04,527 INFO L85 PathProgramCache]: Analyzing trace with hash 434659878, now seen corresponding path program 1 times [2022-02-20 18:53:04,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:04,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897546659] [2022-02-20 18:53:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:04,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {13558#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~__return_6229~0 := 0;~__return_6338~0 := 0;~__tmp_6517_0~0 := 0;~__return_6535~0 := 0;~__return_6446~0 := 0; {13558#true} is VALID [2022-02-20 18:53:04,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {13558#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {13558#true} is VALID [2022-02-20 18:53:04,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {13558#true} assume 0 == ~r1~0; {13558#true} is VALID [2022-02-20 18:53:04,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {13558#true} assume ~id1~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:04,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {13558#true} assume 0 == ~st1~0; {13558#true} is VALID [2022-02-20 18:53:04,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {13558#true} assume ~send1~0 == ~id1~0; {13558#true} is VALID [2022-02-20 18:53:04,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {13558#true} assume 0 == ~mode1~0 % 256; {13558#true} is VALID [2022-02-20 18:53:04,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {13558#true} assume ~id2~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:04,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {13558#true} assume 0 == ~st2~0; {13558#true} is VALID [2022-02-20 18:53:04,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {13558#true} assume ~send2~0 == ~id2~0; {13558#true} is VALID [2022-02-20 18:53:04,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {13558#true} assume 0 == ~mode2~0 % 256; {13558#true} is VALID [2022-02-20 18:53:04,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {13558#true} assume ~id3~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:04,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {13558#true} assume 0 == ~st3~0; {13558#true} is VALID [2022-02-20 18:53:04,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {13558#true} assume ~send3~0 == ~id3~0; {13558#true} is VALID [2022-02-20 18:53:04,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {13558#true} assume 0 == ~mode3~0 % 256; {13558#true} is VALID [2022-02-20 18:53:04,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {13558#true} assume ~id4~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:04,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {13558#true} assume 0 == ~st4~0; {13558#true} is VALID [2022-02-20 18:53:04,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {13558#true} assume ~send4~0 == ~id4~0; {13558#true} is VALID [2022-02-20 18:53:04,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {13558#true} assume 0 == ~mode4~0 % 256; {13558#true} is VALID [2022-02-20 18:53:04,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {13558#true} assume ~id5~0 >= 0; {13558#true} is VALID [2022-02-20 18:53:04,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {13558#true} assume 0 == ~st5~0; {13558#true} is VALID [2022-02-20 18:53:04,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {13558#true} assume ~send5~0 == ~id5~0; {13558#true} is VALID [2022-02-20 18:53:04,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {13558#true} assume 0 == ~mode5~0 % 256; {13558#true} is VALID [2022-02-20 18:53:04,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {13558#true} assume ~id1~0 != ~id2~0; {13558#true} is VALID [2022-02-20 18:53:04,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {13558#true} assume ~id1~0 != ~id3~0; {13558#true} is VALID [2022-02-20 18:53:04,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {13558#true} assume ~id1~0 != ~id4~0; {13558#true} is VALID [2022-02-20 18:53:04,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {13558#true} assume ~id1~0 != ~id5~0; {13558#true} is VALID [2022-02-20 18:53:04,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {13558#true} assume ~id2~0 != ~id3~0; {13558#true} is VALID [2022-02-20 18:53:04,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {13558#true} assume ~id2~0 != ~id4~0; {13558#true} is VALID [2022-02-20 18:53:04,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {13558#true} assume ~id2~0 != ~id5~0; {13558#true} is VALID [2022-02-20 18:53:04,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {13558#true} assume ~id3~0 != ~id4~0; {13558#true} is VALID [2022-02-20 18:53:04,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {13558#true} assume ~id3~0 != ~id5~0; {13558#true} is VALID [2022-02-20 18:53:04,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {13558#true} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {13558#true} is VALID [2022-02-20 18:53:04,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {13558#true} 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;main_~main__i2~0#1 := 0; {13558#true} is VALID [2022-02-20 18:53:04,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {13558#true} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {13558#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:04,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {13558#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {13558#true} is VALID [2022-02-20 18:53:04,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {13558#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {13558#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:04,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {13558#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {13558#true} is VALID [2022-02-20 18:53:04,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {13558#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {13558#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:04,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {13558#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {13558#true} is VALID [2022-02-20 18:53:04,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {13558#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {13558#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:04,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {13558#true} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {13558#true} is VALID [2022-02-20 18:53:04,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {13558#true} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {13558#true} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:04,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {13558#true} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {13558#true} is VALID [2022-02-20 18:53:04,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {13558#true} ~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);~mode5~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;havoc main_~check__tmp~0#1; {13558#true} is VALID [2022-02-20 18:53:04,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {13558#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {13558#true} is VALID [2022-02-20 18:53:04,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {13558#true} assume !(~r1~0 >= 5); {13558#true} is VALID [2022-02-20 18:53:04,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {13558#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {13558#true} is VALID [2022-02-20 18:53:04,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {13558#true} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6338~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; {13558#true} is VALID [2022-02-20 18:53:04,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {13558#true} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {13558#true} is VALID [2022-02-20 18:53:04,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {13558#true} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {13558#true} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {13558#true} assume !(main_~node1__m1~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:04,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {13558#true} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {13558#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {13558#true} assume !(main_~node2__m2~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:04,624 INFO L290 TraceCheckUtils]: 61: Hoare triple {13558#true} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,624 INFO L290 TraceCheckUtils]: 62: Hoare triple {13558#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,624 INFO L290 TraceCheckUtils]: 63: Hoare triple {13558#true} assume !(main_~node3__m3~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:04,625 INFO L290 TraceCheckUtils]: 64: Hoare triple {13558#true} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,625 INFO L290 TraceCheckUtils]: 65: Hoare triple {13558#true} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {13558#true} assume !(main_~node4__m4~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:04,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {13558#true} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {13558#true} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13558#true} is VALID [2022-02-20 18:53:04,626 INFO L290 TraceCheckUtils]: 69: Hoare triple {13558#true} assume !(main_~node5__m5~1#1 != ~nomsg~0); {13558#true} is VALID [2022-02-20 18:53:04,626 INFO L290 TraceCheckUtils]: 70: Hoare triple {13558#true} ~mode5~0 := 0;~__tmp_6517_0~0 := main_~main____CPAchecker_TMP_0~0#1; {13558#true} is VALID [2022-02-20 18:53:04,626 INFO L290 TraceCheckUtils]: 71: Hoare triple {13558#true} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6517_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;havoc main_~check__tmp~1#1; {13558#true} is VALID [2022-02-20 18:53:04,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {13558#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {13558#true} is VALID [2022-02-20 18:53:04,627 INFO L290 TraceCheckUtils]: 73: Hoare triple {13558#true} assume ~r1~0 >= 5; {13560#(not (<= ~r1~0 4))} is VALID [2022-02-20 18:53:04,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {13560#(not (<= ~r1~0 4))} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {13559#false} is VALID [2022-02-20 18:53:04,628 INFO L290 TraceCheckUtils]: 75: Hoare triple {13559#false} ~__return_6535~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6535~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; {13559#false} is VALID [2022-02-20 18:53:04,628 INFO L290 TraceCheckUtils]: 76: Hoare triple {13559#false} assume 0 == main_~assert__arg~1#1 % 256; {13559#false} is VALID [2022-02-20 18:53:04,628 INFO L290 TraceCheckUtils]: 77: Hoare triple {13559#false} assume !false; {13559#false} is VALID [2022-02-20 18:53:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:04,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:04,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897546659] [2022-02-20 18:53:04,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897546659] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:04,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:04,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:53:04,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596494462] [2022-02-20 18:53:04,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:04,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:04,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:04,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:04,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:04,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:53:04,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:04,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:53:04,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:04,679 INFO L87 Difference]: Start difference. First operand 539 states and 817 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:06,099 INFO L93 Difference]: Finished difference Result 1324 states and 2046 transitions. [2022-02-20 18:53:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:53:06,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-02-20 18:53:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-02-20 18:53:06,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 383 transitions. [2022-02-20 18:53:06,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:06,403 INFO L225 Difference]: With dead ends: 1324 [2022-02-20 18:53:06,403 INFO L226 Difference]: Without dead ends: 909 [2022-02-20 18:53:06,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:06,404 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 83 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:06,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:53:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-02-20 18:53:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2022-02-20 18:53:07,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:07,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 909 states. Second operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,359 INFO L74 IsIncluded]: Start isIncluded. First operand 909 states. Second operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,361 INFO L87 Difference]: Start difference. First operand 909 states. Second operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:07,401 INFO L93 Difference]: Finished difference Result 909 states and 1380 transitions. [2022-02-20 18:53:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1380 transitions. [2022-02-20 18:53:07,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:07,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:07,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 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 909 states. [2022-02-20 18:53:07,407 INFO L87 Difference]: Start difference. First operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 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 909 states. [2022-02-20 18:53:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:07,447 INFO L93 Difference]: Finished difference Result 909 states and 1380 transitions. [2022-02-20 18:53:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1380 transitions. [2022-02-20 18:53:07,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:07,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:07,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:07,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1379 transitions. [2022-02-20 18:53:07,501 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1379 transitions. Word has length 78 [2022-02-20 18:53:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:07,502 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 1379 transitions. [2022-02-20 18:53:07,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1379 transitions. [2022-02-20 18:53:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:07,503 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:07,503 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] [2022-02-20 18:53:07,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:53:07,504 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:07,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 450386228, now seen corresponding path program 1 times [2022-02-20 18:53:07,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:07,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416615515] [2022-02-20 18:53:07,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:07,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:07,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {18437#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~__return_6229~0 := 0;~__return_6338~0 := 0;~__tmp_6517_0~0 := 0;~__return_6535~0 := 0;~__return_6446~0 := 0; {18437#true} is VALID [2022-02-20 18:53:07,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {18437#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {18437#true} is VALID [2022-02-20 18:53:07,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {18437#true} assume 0 == ~r1~0; {18437#true} is VALID [2022-02-20 18:53:07,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {18437#true} assume ~id1~0 >= 0; {18437#true} is VALID [2022-02-20 18:53:07,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {18437#true} assume 0 == ~st1~0; {18439#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:07,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {18439#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {18439#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:07,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {18439#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {18439#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:07,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {18439#(<= ~st1~0 0)} assume ~id2~0 >= 0; {18439#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:07,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {18439#(<= ~st1~0 0)} assume 0 == ~st2~0; {18440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {18440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {18440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {18440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {18440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {18440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {18440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {18440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {18441#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode5~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;havoc main_~check__tmp~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,635 INFO L290 TraceCheckUtils]: 51: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,635 INFO L290 TraceCheckUtils]: 52: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,636 INFO L290 TraceCheckUtils]: 53: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6338~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; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,636 INFO L290 TraceCheckUtils]: 55: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,638 INFO L290 TraceCheckUtils]: 59: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,639 INFO L290 TraceCheckUtils]: 60: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,639 INFO L290 TraceCheckUtils]: 61: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,639 INFO L290 TraceCheckUtils]: 62: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,641 INFO L290 TraceCheckUtils]: 65: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,641 INFO L290 TraceCheckUtils]: 66: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,641 INFO L290 TraceCheckUtils]: 67: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node5__m5~1#1 != ~nomsg~0; {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,642 INFO L290 TraceCheckUtils]: 70: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 > ~id5~0); {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:07,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {18442#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node5__m5~1#1 == ~id5~0;~st5~0 := 1; {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:53:07,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} ~mode5~0 := 0;~__tmp_6517_0~0 := main_~main____CPAchecker_TMP_0~0#1; {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:53:07,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6517_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;havoc main_~check__tmp~1#1; {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:53:07,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {18443#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {18438#false} is VALID [2022-02-20 18:53:07,645 INFO L290 TraceCheckUtils]: 75: Hoare triple {18438#false} ~__return_6535~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6535~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; {18438#false} is VALID [2022-02-20 18:53:07,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {18438#false} assume 0 == main_~assert__arg~1#1 % 256; {18438#false} is VALID [2022-02-20 18:53:07,645 INFO L290 TraceCheckUtils]: 77: Hoare triple {18438#false} assume !false; {18438#false} is VALID [2022-02-20 18:53:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:07,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:07,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416615515] [2022-02-20 18:53:07,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416615515] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:07,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:07,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:07,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523902543] [2022-02-20 18:53:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:07,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:07,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:07,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:07,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:07,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:07,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:07,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:07,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:07,714 INFO L87 Difference]: Start difference. First operand 907 states and 1379 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:10,516 INFO L93 Difference]: Finished difference Result 2058 states and 3161 transitions. [2022-02-20 18:53:10,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:10,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:53:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:53:10,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 860 transitions. [2022-02-20 18:53:11,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 860 edges. 860 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:11,248 INFO L225 Difference]: With dead ends: 2058 [2022-02-20 18:53:11,249 INFO L226 Difference]: Without dead ends: 1833 [2022-02-20 18:53:11,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:11,250 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 1036 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:11,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1036 Valid, 1296 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2022-02-20 18:53:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1131. [2022-02-20 18:53:12,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:12,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1833 states. Second operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:12,475 INFO L74 IsIncluded]: Start isIncluded. First operand 1833 states. Second operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:12,477 INFO L87 Difference]: Start difference. First operand 1833 states. Second operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:12,573 INFO L93 Difference]: Finished difference Result 1833 states and 2810 transitions. [2022-02-20 18:53:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2810 transitions. [2022-02-20 18:53:12,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:12,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:12,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 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 1833 states. [2022-02-20 18:53:12,580 INFO L87 Difference]: Start difference. First operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 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 1833 states. [2022-02-20 18:53:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:12,685 INFO L93 Difference]: Finished difference Result 1833 states and 2810 transitions. [2022-02-20 18:53:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2810 transitions. [2022-02-20 18:53:12,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:12,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:12,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:12,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1726 transitions. [2022-02-20 18:53:12,756 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1726 transitions. Word has length 78 [2022-02-20 18:53:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:12,756 INFO L470 AbstractCegarLoop]: Abstraction has 1131 states and 1726 transitions. [2022-02-20 18:53:12,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1726 transitions. [2022-02-20 18:53:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:12,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:12,758 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] [2022-02-20 18:53:12,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:53:12,758 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:12,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:12,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1926158884, now seen corresponding path program 1 times [2022-02-20 18:53:12,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:12,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377322803] [2022-02-20 18:53:12,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:12,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {26517#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~__return_6229~0 := 0;~__return_6338~0 := 0;~__tmp_6517_0~0 := 0;~__return_6535~0 := 0;~__return_6446~0 := 0; {26517#true} is VALID [2022-02-20 18:53:12,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {26517#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {26517#true} is VALID [2022-02-20 18:53:12,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {26517#true} assume 0 == ~r1~0; {26517#true} is VALID [2022-02-20 18:53:12,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {26517#true} assume ~id1~0 >= 0; {26517#true} is VALID [2022-02-20 18:53:12,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {26517#true} assume 0 == ~st1~0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:12,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {26519#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:12,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {26519#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:12,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {26519#(<= ~st1~0 0)} assume ~id2~0 >= 0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:12,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {26519#(<= ~st1~0 0)} assume 0 == ~st2~0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:12,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {26519#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:12,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {26519#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:12,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {26519#(<= ~st1~0 0)} assume ~id3~0 >= 0; {26519#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:12,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {26519#(<= ~st1~0 0)} assume 0 == ~st3~0; {26520#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {26520#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {26520#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {26520#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {26520#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {26520#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {26520#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {26520#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id5~0 >= 0; {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {26521#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~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;main_~main__i2~0#1 := 0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,864 INFO L290 TraceCheckUtils]: 41: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,868 INFO L290 TraceCheckUtils]: 47: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~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);~mode5~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;havoc main_~check__tmp~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,869 INFO L290 TraceCheckUtils]: 50: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 5); {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6338~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; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,871 INFO L290 TraceCheckUtils]: 55: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:12,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {26522#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,874 INFO L290 TraceCheckUtils]: 63: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,876 INFO L290 TraceCheckUtils]: 67: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,877 INFO L290 TraceCheckUtils]: 70: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode5~0 := 0;~__tmp_6517_0~0 := main_~main____CPAchecker_TMP_0~0#1; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6517_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;havoc main_~check__tmp~1#1; {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:12,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {26523#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {26518#false} is VALID [2022-02-20 18:53:12,880 INFO L290 TraceCheckUtils]: 75: Hoare triple {26518#false} ~__return_6535~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6535~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; {26518#false} is VALID [2022-02-20 18:53:12,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {26518#false} assume 0 == main_~assert__arg~1#1 % 256; {26518#false} is VALID [2022-02-20 18:53:12,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {26518#false} assume !false; {26518#false} is VALID [2022-02-20 18:53:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:12,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:12,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377322803] [2022-02-20 18:53:12,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377322803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:12,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:12,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:12,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830202519] [2022-02-20 18:53:12,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:12,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:12,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:12,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:12,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:12,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:12,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:12,937 INFO L87 Difference]: Start difference. First operand 1131 states and 1726 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:16,628 INFO L93 Difference]: Finished difference Result 2292 states and 3524 transitions. [2022-02-20 18:53:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:16,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:53:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:53:16,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 860 transitions. [2022-02-20 18:53:17,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 860 edges. 860 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:17,391 INFO L225 Difference]: With dead ends: 2292 [2022-02-20 18:53:17,392 INFO L226 Difference]: Without dead ends: 2067 [2022-02-20 18:53:17,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:17,393 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 1078 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:17,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1078 Valid, 1595 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-02-20 18:53:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1370. [2022-02-20 18:53:19,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:19,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2067 states. Second operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,299 INFO L74 IsIncluded]: Start isIncluded. First operand 2067 states. Second operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,302 INFO L87 Difference]: Start difference. First operand 2067 states. Second operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:19,421 INFO L93 Difference]: Finished difference Result 2067 states and 3173 transitions. [2022-02-20 18:53:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3173 transitions. [2022-02-20 18:53:19,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:19,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:19,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 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 2067 states. [2022-02-20 18:53:19,429 INFO L87 Difference]: Start difference. First operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 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 2067 states. [2022-02-20 18:53:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:19,573 INFO L93 Difference]: Finished difference Result 2067 states and 3173 transitions. [2022-02-20 18:53:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3173 transitions. [2022-02-20 18:53:19,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:19,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:19,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:19,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2097 transitions. [2022-02-20 18:53:19,662 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2097 transitions. Word has length 78 [2022-02-20 18:53:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:19,662 INFO L470 AbstractCegarLoop]: Abstraction has 1370 states and 2097 transitions. [2022-02-20 18:53:19,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2097 transitions. [2022-02-20 18:53:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:19,663 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:19,664 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] [2022-02-20 18:53:19,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:53:19,664 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash 100434268, now seen corresponding path program 1 times [2022-02-20 18:53:19,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:19,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364019456] [2022-02-20 18:53:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:19,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {35723#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~__return_6229~0 := 0;~__return_6338~0 := 0;~__tmp_6517_0~0 := 0;~__return_6535~0 := 0;~__return_6446~0 := 0; {35723#true} is VALID [2022-02-20 18:53:19,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {35723#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {35723#true} is VALID [2022-02-20 18:53:19,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {35723#true} assume 0 == ~r1~0; {35723#true} is VALID [2022-02-20 18:53:19,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {35723#true} assume ~id1~0 >= 0; {35723#true} is VALID [2022-02-20 18:53:19,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {35723#true} assume 0 == ~st1~0; {35723#true} is VALID [2022-02-20 18:53:19,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {35723#true} assume ~send1~0 == ~id1~0; {35723#true} is VALID [2022-02-20 18:53:19,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {35723#true} assume 0 == ~mode1~0 % 256; {35723#true} is VALID [2022-02-20 18:53:19,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {35723#true} assume ~id2~0 >= 0; {35723#true} is VALID [2022-02-20 18:53:19,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {35723#true} assume 0 == ~st2~0; {35725#(<= ~st2~0 0)} is VALID [2022-02-20 18:53:19,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {35725#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {35725#(<= ~st2~0 0)} is VALID [2022-02-20 18:53:19,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {35725#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {35725#(<= ~st2~0 0)} is VALID [2022-02-20 18:53:19,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {35725#(<= ~st2~0 0)} assume ~id3~0 >= 0; {35725#(<= ~st2~0 0)} is VALID [2022-02-20 18:53:19,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {35725#(<= ~st2~0 0)} assume 0 == ~st3~0; {35726#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {35726#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {35726#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {35726#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {35726#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {35726#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id4~0 >= 0; {35726#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {35726#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st4~0; {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 == ~id4~0; {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode4~0 % 256; {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id5~0 >= 0; {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {35727#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send5~0 == ~id5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode5~0 % 256; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id4~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id4~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id4~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~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;main_~main__i2~0#1 := 0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,776 INFO L290 TraceCheckUtils]: 42: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~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);~mode5~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;havoc main_~check__tmp~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 5); {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6338~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; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,782 INFO L290 TraceCheckUtils]: 57: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:19,783 INFO L290 TraceCheckUtils]: 59: Hoare triple {35728#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,784 INFO L290 TraceCheckUtils]: 61: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,786 INFO L290 TraceCheckUtils]: 66: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,787 INFO L290 TraceCheckUtils]: 67: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,787 INFO L290 TraceCheckUtils]: 68: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,788 INFO L290 TraceCheckUtils]: 69: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,788 INFO L290 TraceCheckUtils]: 70: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,789 INFO L290 TraceCheckUtils]: 71: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,789 INFO L290 TraceCheckUtils]: 72: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode5~0 := 0;~__tmp_6517_0~0 := main_~main____CPAchecker_TMP_0~0#1; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,790 INFO L290 TraceCheckUtils]: 73: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6517_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;havoc main_~check__tmp~1#1; {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:19,790 INFO L290 TraceCheckUtils]: 74: Hoare triple {35729#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {35724#false} is VALID [2022-02-20 18:53:19,790 INFO L290 TraceCheckUtils]: 75: Hoare triple {35724#false} ~__return_6535~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6535~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; {35724#false} is VALID [2022-02-20 18:53:19,790 INFO L290 TraceCheckUtils]: 76: Hoare triple {35724#false} assume 0 == main_~assert__arg~1#1 % 256; {35724#false} is VALID [2022-02-20 18:53:19,790 INFO L290 TraceCheckUtils]: 77: Hoare triple {35724#false} assume !false; {35724#false} is VALID [2022-02-20 18:53:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:19,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:19,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364019456] [2022-02-20 18:53:19,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364019456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:19,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:19,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:19,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194802164] [2022-02-20 18:53:19,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:19,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:19,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:19,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:19,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:19,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:19,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:19,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:19,855 INFO L87 Difference]: Start difference. First operand 1370 states and 2097 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:24,629 INFO L93 Difference]: Finished difference Result 2531 states and 3895 transitions. [2022-02-20 18:53:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:53:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-02-20 18:53:24,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 860 transitions. [2022-02-20 18:53:25,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 860 edges. 860 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:25,397 INFO L225 Difference]: With dead ends: 2531 [2022-02-20 18:53:25,397 INFO L226 Difference]: Without dead ends: 2306 [2022-02-20 18:53:25,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:25,398 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1082 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:25,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1082 Valid, 1257 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-02-20 18:53:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1609. [2022-02-20 18:53:28,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:28,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2306 states. Second operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:28,089 INFO L74 IsIncluded]: Start isIncluded. First operand 2306 states. Second operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:28,091 INFO L87 Difference]: Start difference. First operand 2306 states. Second operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:28,235 INFO L93 Difference]: Finished difference Result 2306 states and 3544 transitions. [2022-02-20 18:53:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3544 transitions. [2022-02-20 18:53:28,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:28,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:28,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 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 2306 states. [2022-02-20 18:53:28,240 INFO L87 Difference]: Start difference. First operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 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 2306 states. [2022-02-20 18:53:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:28,411 INFO L93 Difference]: Finished difference Result 2306 states and 3544 transitions. [2022-02-20 18:53:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3544 transitions. [2022-02-20 18:53:28,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:28,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:28,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:28,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2468 transitions. [2022-02-20 18:53:28,567 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2468 transitions. Word has length 78 [2022-02-20 18:53:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:28,567 INFO L470 AbstractCegarLoop]: Abstraction has 1609 states and 2468 transitions. [2022-02-20 18:53:28,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2468 transitions. [2022-02-20 18:53:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:53:28,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:28,568 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] [2022-02-20 18:53:28,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:53:28,569 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1588436194, now seen corresponding path program 1 times [2022-02-20 18:53:28,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:28,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539682153] [2022-02-20 18:53:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:28,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:28,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {46071#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~__return_6229~0 := 0;~__return_6338~0 := 0;~__tmp_6517_0~0 := 0;~__return_6535~0 := 0;~__return_6446~0 := 0; {46073#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:28,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {46073#(<= (+ ~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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {46073#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:28,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {46073#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {46073#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:28,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {46073#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {46074#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:53:28,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {46074#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {46074#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:53:28,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {46074#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6229~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6229~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {46075#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:28,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {46075#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {46072#false} is VALID [2022-02-20 18:53:28,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {46072#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {46072#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:53:28,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {46072#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {46072#false} is VALID [2022-02-20 18:53:28,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {46072#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {46072#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:53:28,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {46072#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {46072#false} is VALID [2022-02-20 18:53:28,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {46072#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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {46072#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:53:28,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {46072#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {46072#false} is VALID [2022-02-20 18:53:28,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {46072#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {46072#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:53:28,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {46072#false} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {46072#false} is VALID [2022-02-20 18:53:28,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {46072#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);~mode5~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;havoc main_~check__tmp~0#1; {46072#false} is VALID [2022-02-20 18:53:28,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {46072#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {46072#false} is VALID [2022-02-20 18:53:28,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {46072#false} assume !(~r1~0 >= 5); {46072#false} is VALID [2022-02-20 18:53:28,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {46072#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {46072#false} is VALID [2022-02-20 18:53:28,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {46072#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_6338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6338~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; {46072#false} is VALID [2022-02-20 18:53:28,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {46072#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {46072#false} is VALID [2022-02-20 18:53:28,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {46072#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {46072#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {46072#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:53:28,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {46072#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {46072#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {46072#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:53:28,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {46072#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {46072#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {46072#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:53:28,657 INFO L290 TraceCheckUtils]: 64: Hoare triple {46072#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,657 INFO L290 TraceCheckUtils]: 65: Hoare triple {46072#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,658 INFO L290 TraceCheckUtils]: 66: Hoare triple {46072#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:53:28,658 INFO L290 TraceCheckUtils]: 67: Hoare triple {46072#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {46072#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {46072#false} is VALID [2022-02-20 18:53:28,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {46072#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {46072#false} is VALID [2022-02-20 18:53:28,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {46072#false} ~mode5~0 := 0;~__tmp_6517_0~0 := main_~main____CPAchecker_TMP_0~0#1; {46072#false} is VALID [2022-02-20 18:53:28,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {46072#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_6517_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;havoc main_~check__tmp~1#1; {46072#false} is VALID [2022-02-20 18:53:28,659 INFO L290 TraceCheckUtils]: 72: Hoare triple {46072#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {46072#false} is VALID [2022-02-20 18:53:28,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {46072#false} assume !(~r1~0 >= 5); {46072#false} is VALID [2022-02-20 18:53:28,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {46072#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {46072#false} is VALID [2022-02-20 18:53:28,659 INFO L290 TraceCheckUtils]: 75: Hoare triple {46072#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {46072#false} is VALID [2022-02-20 18:53:28,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {46072#false} ~__return_6535~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6535~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; {46072#false} is VALID [2022-02-20 18:53:28,659 INFO L290 TraceCheckUtils]: 77: Hoare triple {46072#false} assume 0 == main_~assert__arg~1#1 % 256; {46072#false} is VALID [2022-02-20 18:53:28,659 INFO L290 TraceCheckUtils]: 78: Hoare triple {46072#false} assume !false; {46072#false} is VALID [2022-02-20 18:53:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:28,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:28,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539682153] [2022-02-20 18:53:28,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539682153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:28,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:28,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:53:28,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389805427] [2022-02-20 18:53:28,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:28,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:53:28,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:28,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:28,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:28,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:53:28,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:28,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:53:28,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:53:28,726 INFO L87 Difference]: Start difference. First operand 1609 states and 2468 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:36,582 INFO L93 Difference]: Finished difference Result 4698 states and 7251 transitions. [2022-02-20 18:53:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:53:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:53:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-02-20 18:53:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-02-20 18:53:36,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 494 transitions. [2022-02-20 18:53:36,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:37,328 INFO L225 Difference]: With dead ends: 4698 [2022-02-20 18:53:37,328 INFO L226 Difference]: Without dead ends: 3127 [2022-02-20 18:53:37,330 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:53:37,331 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 802 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:37,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [802 Valid, 178 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states.