./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.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.4.ufo.BOUNDED-8.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 3fd48462b17ddbaf278fc488df1a3ae435e9f6d18bb30b30a9517aad37d6aece --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:52:00,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:52:00,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:52:00,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:52:00,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:52:00,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:52:00,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:52:00,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:52:00,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:52:00,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:52:00,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:52:00,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:52:00,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:52:00,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:52:00,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:52:00,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:52:00,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:52:00,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:52:00,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:52:00,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:52:00,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:52:00,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:52:00,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:52:00,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:52:00,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:52:00,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:52:00,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:52:00,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:52:00,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:52:00,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:52:00,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:52:00,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:52:00,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:52:00,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:52:00,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:52:00,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:52:00,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:52:00,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:52:00,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:52:00,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:52:00,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:52:00,765 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:00,780 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:52:00,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:52:00,780 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:52:00,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:52:00,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:52:00,781 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:52:00,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:52:00,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:52:00,782 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:52:00,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:52:00,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:52:00,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:52:00,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:52:00,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:52:00,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:52:00,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:52:00,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:52:00,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:52:00,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:52:00,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:52:00,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:52:00,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:52:00,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:52:00,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:52:00,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:00,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:52:00,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:52:00,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:52:00,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:52:00,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:52:00,786 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:52:00,786 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:52:00,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:52:00,786 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 -> 3fd48462b17ddbaf278fc488df1a3ae435e9f6d18bb30b30a9517aad37d6aece [2022-02-20 18:52:00,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:52:00,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:52:00,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:52:00,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:52:00,985 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:52:00,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-02-20 18:52:01,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a29b60d/3ca78f1a897241cd81b6656e987fb181/FLAG5615356cc [2022-02-20 18:52:01,381 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:52:01,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-02-20 18:52:01,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a29b60d/3ca78f1a897241cd81b6656e987fb181/FLAG5615356cc [2022-02-20 18:52:01,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a29b60d/3ca78f1a897241cd81b6656e987fb181 [2022-02-20 18:52:01,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:52:01,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:52:01,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:01,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:52:01,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:52:01,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f79cc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01, skipping insertion in model container [2022-02-20 18:52:01,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:52:01,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:52:02,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6778,6791] [2022-02-20 18:52:02,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:02,153 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:52:02,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6778,6791] [2022-02-20 18:52:02,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:02,255 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:52:02,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02 WrapperNode [2022-02-20 18:52:02,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:02,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:02,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:52:02,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:52:02,268 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:02" (1/1) ... [2022-02-20 18:52:02,287 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:02" (1/1) ... [2022-02-20 18:52:02,323 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 527 [2022-02-20 18:52:02,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:02,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:52:02,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:52:02,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:52:02,330 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:02" (1/1) ... [2022-02-20 18:52:02,331 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:02" (1/1) ... [2022-02-20 18:52:02,333 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:02" (1/1) ... [2022-02-20 18:52:02,333 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:02" (1/1) ... [2022-02-20 18:52:02,339 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:02" (1/1) ... [2022-02-20 18:52:02,342 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:02" (1/1) ... [2022-02-20 18:52:02,344 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:02" (1/1) ... [2022-02-20 18:52:02,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:52:02,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:52:02,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:52:02,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:52:02,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (1/1) ... [2022-02-20 18:52:02,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:02,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:52:02,386 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:02,390 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:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:52:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:52:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:52:02,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:52:02,493 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:52:02,494 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:52:02,987 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:52:02,993 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:52:02,995 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:52:02,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:02 BoogieIcfgContainer [2022-02-20 18:52:02,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:52:02,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:52:02,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:52:03,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:52:03,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:52:01" (1/3) ... [2022-02-20 18:52:03,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f701aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:03, skipping insertion in model container [2022-02-20 18:52:03,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:02" (2/3) ... [2022-02-20 18:52:03,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f701aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:03, skipping insertion in model container [2022-02-20 18:52:03,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:02" (3/3) ... [2022-02-20 18:52:03,005 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-02-20 18:52:03,008 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:52:03,008 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:52:03,049 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:52:03,055 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:03,055 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:52:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 122 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:03,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:03,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:03,101 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1296157629, now seen corresponding path program 1 times [2022-02-20 18:52:03,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:03,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613851918] [2022-02-20 18:52:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:03,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {126#true} is VALID [2022-02-20 18:52:03,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#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_~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_~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_~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;havoc main_~init__tmp~0#1; {126#true} is VALID [2022-02-20 18:52:03,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} assume 0 == ~r1~0; {126#true} is VALID [2022-02-20 18:52:03,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {126#true} assume ~id1~0 >= 0; {126#true} is VALID [2022-02-20 18:52:03,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#true} assume 0 == ~st1~0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:03,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:03,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:03,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#(<= ~st1~0 0)} assume ~id2~0 >= 0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:03,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#(<= ~st1~0 0)} assume 0 == ~st2~0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {131#(<= (+ ~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;main_~main__i2~0#1 := 0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {131#(<= (+ ~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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {131#(<= (+ ~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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,544 INFO L290 TraceCheckUtils]: 51: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,548 INFO L290 TraceCheckUtils]: 54: Hoare triple {131#(<= (+ ~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:03,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {127#false} is VALID [2022-02-20 18:52:03,553 INFO L290 TraceCheckUtils]: 59: Hoare triple {127#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {127#false} is VALID [2022-02-20 18:52:03,553 INFO L290 TraceCheckUtils]: 60: Hoare triple {127#false} assume 0 == main_~assert__arg~1#1 % 256; {127#false} is VALID [2022-02-20 18:52:03,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {127#false} assume !false; {127#false} is VALID [2022-02-20 18:52:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:03,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:03,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613851918] [2022-02-20 18:52:03,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613851918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:03,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:03,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:03,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941037414] [2022-02-20 18:52:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:03,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:52:03,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:03,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:03,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:03,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:03,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:03,651 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 122 states have internal predecessors, (212), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:04,958 INFO L93 Difference]: Finished difference Result 589 states and 942 transitions. [2022-02-20 18:52:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:52:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:52:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 942 transitions. [2022-02-20 18:52:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 942 transitions. [2022-02-20 18:52:04,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 942 transitions. [2022-02-20 18:52:05,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 942 edges. 942 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:05,652 INFO L225 Difference]: With dead ends: 589 [2022-02-20 18:52:05,652 INFO L226 Difference]: Without dead ends: 511 [2022-02-20 18:52:05,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:05,657 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 910 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:05,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [910 Valid, 1605 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-02-20 18:52:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 185. [2022-02-20 18:52:05,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:05,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call 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:05,742 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call 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:05,753 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call 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:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:05,768 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2022-02-20 18:52:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 769 transitions. [2022-02-20 18:52:05,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:05,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:05,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:52:05,772 INFO L87 Difference]: Start difference. First operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:52:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:05,787 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2022-02-20 18:52:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 769 transitions. [2022-02-20 18:52:05,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:05,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:05,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:05,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call 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:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 267 transitions. [2022-02-20 18:52:05,794 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 267 transitions. Word has length 62 [2022-02-20 18:52:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:05,794 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 267 transitions. [2022-02-20 18:52:05,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 267 transitions. [2022-02-20 18:52:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:05,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:05,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:05,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:52:05,796 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash -574954446, now seen corresponding path program 1 times [2022-02-20 18:52:05,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:05,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471837564] [2022-02-20 18:52:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:05,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:05,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {2189#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {2189#true} is VALID [2022-02-20 18:52:05,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {2189#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_~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_~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_~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;havoc main_~init__tmp~0#1; {2189#true} is VALID [2022-02-20 18:52:05,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {2189#true} assume 0 == ~r1~0; {2189#true} is VALID [2022-02-20 18:52:05,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {2189#true} assume ~id1~0 >= 0; {2189#true} is VALID [2022-02-20 18:52:05,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {2189#true} assume 0 == ~st1~0; {2189#true} is VALID [2022-02-20 18:52:05,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {2189#true} assume ~send1~0 == ~id1~0; {2189#true} is VALID [2022-02-20 18:52:05,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {2189#true} assume 0 == ~mode1~0 % 256; {2189#true} is VALID [2022-02-20 18:52:05,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {2189#true} assume ~id2~0 >= 0; {2189#true} is VALID [2022-02-20 18:52:05,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {2189#true} assume 0 == ~st2~0; {2191#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:05,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {2191#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {2191#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:05,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {2191#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {2191#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:05,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {2191#(<= ~st2~0 0)} assume ~id3~0 >= 0; {2191#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:05,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {2191#(<= ~st2~0 0)} assume 0 == ~st3~0; {2192#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {2192#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {2192#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {2192#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id4~0 >= 0; {2192#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {2192#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 == ~id4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode4~0 % 256; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {2193#(<= (+ ~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;main_~main__i2~0#1 := 0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {2193#(<= (+ ~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; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {2193#(<= (+ ~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; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {2193#(<= (+ ~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; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#(<= (+ ~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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 4); {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {2193#(<= (+ ~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; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {2193#(<= (+ ~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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:05,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 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; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 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; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,964 INFO L290 TraceCheckUtils]: 55: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 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; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,966 INFO L290 TraceCheckUtils]: 59: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:05,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {2190#false} is VALID [2022-02-20 18:52:05,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {2190#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {2190#false} is VALID [2022-02-20 18:52:05,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {2190#false} assume 0 == main_~assert__arg~1#1 % 256; {2190#false} is VALID [2022-02-20 18:52:05,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {2190#false} assume !false; {2190#false} is VALID [2022-02-20 18:52:05,968 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:05,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:05,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471837564] [2022-02-20 18:52:05,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471837564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:05,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:05,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:05,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554735840] [2022-02-20 18:52:05,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:05,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:05,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:05,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:06,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:06,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:06,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:06,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:06,019 INFO L87 Difference]: Start difference. First operand 185 states and 267 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,011 INFO L93 Difference]: Finished difference Result 654 states and 1000 transitions. [2022-02-20 18:52:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:07,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:52:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:52:07,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 615 transitions. [2022-02-20 18:52:07,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:07,393 INFO L225 Difference]: With dead ends: 654 [2022-02-20 18:52:07,394 INFO L226 Difference]: Without dead ends: 554 [2022-02-20 18:52:07,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:07,395 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 520 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:07,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 1030 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-02-20 18:52:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 294. [2022-02-20 18:52:07,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:07,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 554 states. Second operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,594 INFO L74 IsIncluded]: Start isIncluded. First operand 554 states. Second operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,595 INFO L87 Difference]: Start difference. First operand 554 states. Second operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,609 INFO L93 Difference]: Finished difference Result 554 states and 842 transitions. [2022-02-20 18:52:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 842 transitions. [2022-02-20 18:52:07,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 554 states. [2022-02-20 18:52:07,611 INFO L87 Difference]: Start difference. First operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 554 states. [2022-02-20 18:52:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,624 INFO L93 Difference]: Finished difference Result 554 states and 842 transitions. [2022-02-20 18:52:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 842 transitions. [2022-02-20 18:52:07,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:07,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 439 transitions. [2022-02-20 18:52:07,632 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 439 transitions. Word has length 64 [2022-02-20 18:52:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:07,632 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 439 transitions. [2022-02-20 18:52:07,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2022-02-20 18:52:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:07,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:07,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:07,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:52:07,633 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -254559290, now seen corresponding path program 1 times [2022-02-20 18:52:07,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:07,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546097075] [2022-02-20 18:52:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:07,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {4578#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {4578#true} is VALID [2022-02-20 18:52:07,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {4578#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_~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_~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_~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;havoc main_~init__tmp~0#1; {4578#true} is VALID [2022-02-20 18:52:07,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {4578#true} assume 0 == ~r1~0; {4578#true} is VALID [2022-02-20 18:52:07,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {4578#true} assume ~id1~0 >= 0; {4578#true} is VALID [2022-02-20 18:52:07,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {4578#true} assume 0 == ~st1~0; {4580#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:07,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {4580#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4580#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:07,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {4580#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4580#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:07,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {4580#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4580#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:07,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {4580#(<= ~st1~0 0)} assume 0 == ~st2~0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {4582#(<= (+ ~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;main_~main__i2~0#1 := 0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {4582#(<= (+ ~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; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {4582#(<= (+ ~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; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {4582#(<= (+ ~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; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {4582#(<= (+ ~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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {4582#(<= (+ ~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; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {4582#(<= (+ ~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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,730 INFO L290 TraceCheckUtils]: 48: Hoare triple {4582#(<= (+ ~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; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,731 INFO L290 TraceCheckUtils]: 50: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {4582#(<= (+ ~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; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:07,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:07,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:07,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 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; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:07,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:07,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:07,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:07,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {4579#false} is VALID [2022-02-20 18:52:07,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {4579#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {4579#false} is VALID [2022-02-20 18:52:07,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {4579#false} assume 0 == main_~assert__arg~1#1 % 256; {4579#false} is VALID [2022-02-20 18:52:07,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {4579#false} assume !false; {4579#false} is VALID [2022-02-20 18:52:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:07,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:07,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546097075] [2022-02-20 18:52:07,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546097075] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:07,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:07,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:07,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588194094] [2022-02-20 18:52:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:07,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:07,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:07,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:07,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:07,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:07,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:07,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:07,786 INFO L87 Difference]: Start difference. First operand 294 states and 439 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:08,752 INFO L93 Difference]: Finished difference Result 763 states and 1172 transitions. [2022-02-20 18:52:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:08,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:52:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:52:08,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 615 transitions. [2022-02-20 18:52:09,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:09,137 INFO L225 Difference]: With dead ends: 763 [2022-02-20 18:52:09,137 INFO L226 Difference]: Without dead ends: 663 [2022-02-20 18:52:09,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:09,138 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 600 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:09,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [600 Valid, 792 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-02-20 18:52:09,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 447. [2022-02-20 18:52:09,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:09,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 663 states. Second operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,465 INFO L74 IsIncluded]: Start isIncluded. First operand 663 states. Second operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,466 INFO L87 Difference]: Start difference. First operand 663 states. Second operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,480 INFO L93 Difference]: Finished difference Result 663 states and 1014 transitions. [2022-02-20 18:52:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1014 transitions. [2022-02-20 18:52:09,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 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 663 states. [2022-02-20 18:52:09,483 INFO L87 Difference]: Start difference. First operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 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 663 states. [2022-02-20 18:52:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,497 INFO L93 Difference]: Finished difference Result 663 states and 1014 transitions. [2022-02-20 18:52:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1014 transitions. [2022-02-20 18:52:09,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:09,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 680 transitions. [2022-02-20 18:52:09,508 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 680 transitions. Word has length 64 [2022-02-20 18:52:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:09,509 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 680 transitions. [2022-02-20 18:52:09,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,510 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 680 transitions. [2022-02-20 18:52:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:09,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:09,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:09,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:52:09,511 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1989488918, now seen corresponding path program 1 times [2022-02-20 18:52:09,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:09,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585767980] [2022-02-20 18:52:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:09,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:09,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {7547#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {7547#true} is VALID [2022-02-20 18:52:09,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {7547#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_~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_~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_~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;havoc main_~init__tmp~0#1; {7547#true} is VALID [2022-02-20 18:52:09,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {7547#true} assume 0 == ~r1~0; {7547#true} is VALID [2022-02-20 18:52:09,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {7547#true} assume ~id1~0 >= 0; {7547#true} is VALID [2022-02-20 18:52:09,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {7547#true} assume 0 == ~st1~0; {7549#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:09,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {7549#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {7549#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:09,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {7549#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {7549#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:09,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {7549#(<= ~st1~0 0)} assume ~id2~0 >= 0; {7549#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:09,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {7549#(<= ~st1~0 0)} assume 0 == ~st2~0; {7550#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {7550#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {7550#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {7550#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {7550#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {7550#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {7550#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {7550#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {7551#(<= (+ ~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;main_~main__i2~0#1 := 0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {7551#(<= (+ ~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; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {7551#(<= (+ ~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; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {7551#(<= (+ ~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; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {7551#(<= (+ ~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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {7551#(<= (+ ~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; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {7551#(<= (+ ~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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {7551#(<= (+ ~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; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {7551#(<= (+ ~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; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,596 INFO L290 TraceCheckUtils]: 53: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,596 INFO L290 TraceCheckUtils]: 54: Hoare triple {7551#(<= (+ ~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; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 != ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 > ~id4~0); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:09,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:09,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:09,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:52:09,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {7548#false} is VALID [2022-02-20 18:52:09,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {7548#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {7548#false} is VALID [2022-02-20 18:52:09,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {7548#false} assume 0 == main_~assert__arg~1#1 % 256; {7548#false} is VALID [2022-02-20 18:52:09,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {7548#false} assume !false; {7548#false} is VALID [2022-02-20 18:52:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:09,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:09,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585767980] [2022-02-20 18:52:09,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585767980] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:09,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:09,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:09,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477016276] [2022-02-20 18:52:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:09,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:09,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:09,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:09,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:09,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:09,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:09,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:09,639 INFO L87 Difference]: Start difference. First operand 447 states and 680 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:10,698 INFO L93 Difference]: Finished difference Result 862 states and 1328 transitions. [2022-02-20 18:52:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:52:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:52:10,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 615 transitions. [2022-02-20 18:52:11,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:11,113 INFO L225 Difference]: With dead ends: 862 [2022-02-20 18:52:11,113 INFO L226 Difference]: Without dead ends: 762 [2022-02-20 18:52:11,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:11,122 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 677 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:11,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [677 Valid, 780 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-02-20 18:52:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 546. [2022-02-20 18:52:11,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:11,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 762 states. Second operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call 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:11,516 INFO L74 IsIncluded]: Start isIncluded. First operand 762 states. Second operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call 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:11,517 INFO L87 Difference]: Start difference. First operand 762 states. Second operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call 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:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:11,535 INFO L93 Difference]: Finished difference Result 762 states and 1170 transitions. [2022-02-20 18:52:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1170 transitions. [2022-02-20 18:52:11,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:11,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:11,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 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 762 states. [2022-02-20 18:52:11,538 INFO L87 Difference]: Start difference. First operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 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 762 states. [2022-02-20 18:52:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:11,556 INFO L93 Difference]: Finished difference Result 762 states and 1170 transitions. [2022-02-20 18:52:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1170 transitions. [2022-02-20 18:52:11,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:11,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:11,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:11,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call 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:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 836 transitions. [2022-02-20 18:52:11,570 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 836 transitions. Word has length 64 [2022-02-20 18:52:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:11,570 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 836 transitions. [2022-02-20 18:52:11,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 836 transitions. [2022-02-20 18:52:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:11,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:11,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:11,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:52:11,572 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1188595012, now seen corresponding path program 1 times [2022-02-20 18:52:11,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:11,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107223056] [2022-02-20 18:52:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:11,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {10990#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {10990#true} is VALID [2022-02-20 18:52:11,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {10990#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_~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_~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_~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;havoc main_~init__tmp~0#1; {10990#true} is VALID [2022-02-20 18:52:11,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {10990#true} assume 0 == ~r1~0; {10990#true} is VALID [2022-02-20 18:52:11,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {10990#true} assume ~id1~0 >= 0; {10990#true} is VALID [2022-02-20 18:52:11,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {10990#true} assume 0 == ~st1~0; {10990#true} is VALID [2022-02-20 18:52:11,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {10990#true} assume ~send1~0 == ~id1~0; {10990#true} is VALID [2022-02-20 18:52:11,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {10990#true} assume 0 == ~mode1~0 % 256; {10990#true} is VALID [2022-02-20 18:52:11,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {10990#true} assume ~id2~0 >= 0; {10990#true} is VALID [2022-02-20 18:52:11,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {10990#true} assume 0 == ~st2~0; {10990#true} is VALID [2022-02-20 18:52:11,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {10990#true} assume ~send2~0 == ~id2~0; {10990#true} is VALID [2022-02-20 18:52:11,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {10990#true} assume 0 == ~mode2~0 % 256; {10990#true} is VALID [2022-02-20 18:52:11,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {10990#true} assume ~id3~0 >= 0; {10990#true} is VALID [2022-02-20 18:52:11,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {10990#true} assume 0 == ~st3~0; {10990#true} is VALID [2022-02-20 18:52:11,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {10990#true} assume ~send3~0 == ~id3~0; {10990#true} is VALID [2022-02-20 18:52:11,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {10990#true} assume 0 == ~mode3~0 % 256; {10990#true} is VALID [2022-02-20 18:52:11,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {10990#true} assume ~id4~0 >= 0; {10990#true} is VALID [2022-02-20 18:52:11,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {10990#true} assume 0 == ~st4~0; {10990#true} is VALID [2022-02-20 18:52:11,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {10990#true} assume ~send4~0 == ~id4~0; {10990#true} is VALID [2022-02-20 18:52:11,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {10990#true} assume 0 == ~mode4~0 % 256; {10990#true} is VALID [2022-02-20 18:52:11,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {10990#true} assume ~id1~0 != ~id2~0; {10990#true} is VALID [2022-02-20 18:52:11,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {10990#true} assume ~id1~0 != ~id3~0; {10990#true} is VALID [2022-02-20 18:52:11,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {10990#true} assume ~id1~0 != ~id4~0; {10990#true} is VALID [2022-02-20 18:52:11,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {10990#true} assume ~id2~0 != ~id3~0; {10990#true} is VALID [2022-02-20 18:52:11,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {10990#true} assume ~id2~0 != ~id4~0; {10990#true} is VALID [2022-02-20 18:52:11,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {10990#true} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {10990#true} is VALID [2022-02-20 18:52:11,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {10990#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;main_~main__i2~0#1 := 0; {10990#true} is VALID [2022-02-20 18:52:11,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {10990#true} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:52:11,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {10990#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:52:11,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {10990#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {10990#true} is VALID [2022-02-20 18:52:11,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {10990#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; {10990#true} is VALID [2022-02-20 18:52:11,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {10990#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:52:11,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {10990#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10990#true} is VALID [2022-02-20 18:52:11,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {10990#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; {10990#true} is VALID [2022-02-20 18:52:11,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {10990#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:52:11,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {10990#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {10990#true} is VALID [2022-02-20 18:52:11,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {10990#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; {10990#true} is VALID [2022-02-20 18:52:11,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {10990#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:52:11,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {10990#true} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {10990#true} is VALID [2022-02-20 18:52:11,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {10990#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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10990#true} is VALID [2022-02-20 18:52:11,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {10990#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {10990#true} is VALID [2022-02-20 18:52:11,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {10990#true} assume !(~r1~0 >= 4); {10990#true} is VALID [2022-02-20 18:52:11,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {10990#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {10990#true} is VALID [2022-02-20 18:52:11,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {10990#true} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {10990#true} is VALID [2022-02-20 18:52:11,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {10990#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; {10990#true} is VALID [2022-02-20 18:52:11,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {10990#true} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:52:11,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {10990#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:52:11,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {10990#true} assume !(main_~node1__m1~1#1 != ~nomsg~0); {10990#true} is VALID [2022-02-20 18:52:11,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {10990#true} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:52:11,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {10990#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:52:11,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {10990#true} assume !(main_~node2__m2~1#1 != ~nomsg~0); {10990#true} is VALID [2022-02-20 18:52:11,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {10990#true} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:52:11,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {10990#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:52:11,642 INFO L290 TraceCheckUtils]: 52: Hoare triple {10990#true} assume !(main_~node3__m3~1#1 != ~nomsg~0); {10990#true} is VALID [2022-02-20 18:52:11,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {10990#true} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:52:11,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {10990#true} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:52:11,642 INFO L290 TraceCheckUtils]: 55: Hoare triple {10990#true} assume !(main_~node4__m4~1#1 != ~nomsg~0); {10990#true} is VALID [2022-02-20 18:52:11,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {10990#true} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:52:11,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {10990#true} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {10990#true} is VALID [2022-02-20 18:52:11,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {10990#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {10990#true} is VALID [2022-02-20 18:52:11,643 INFO L290 TraceCheckUtils]: 59: Hoare triple {10990#true} assume ~r1~0 >= 4; {10992#(not (<= ~r1~0 3))} is VALID [2022-02-20 18:52:11,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {10992#(not (<= ~r1~0 3))} assume ~r1~0 < 4;main_~check__tmp~1#1 := 1; {10991#false} is VALID [2022-02-20 18:52:11,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {10991#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {10991#false} is VALID [2022-02-20 18:52:11,644 INFO L290 TraceCheckUtils]: 62: Hoare triple {10991#false} assume 0 == main_~assert__arg~1#1 % 256; {10991#false} is VALID [2022-02-20 18:52:11,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {10991#false} assume !false; {10991#false} is VALID [2022-02-20 18:52:11,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:52:11,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:11,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107223056] [2022-02-20 18:52:11,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107223056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:11,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:11,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:11,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089733741] [2022-02-20 18:52:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:11,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:11,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:11,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:11,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:11,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:11,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:11,679 INFO L87 Difference]: Start difference. First operand 546 states and 836 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:12,638 INFO L93 Difference]: Finished difference Result 1374 states and 2132 transitions. [2022-02-20 18:52:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:12,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-02-20 18:52:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-02-20 18:52:12,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 314 transitions. [2022-02-20 18:52:12,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:12,835 INFO L225 Difference]: With dead ends: 1374 [2022-02-20 18:52:12,835 INFO L226 Difference]: Without dead ends: 931 [2022-02-20 18:52:12,838 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:52:12,841 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 67 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 380 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:52:12,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-02-20 18:52:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2022-02-20 18:52:13,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:13,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,597 INFO L74 IsIncluded]: Start isIncluded. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,598 INFO L87 Difference]: Start difference. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:13,626 INFO L93 Difference]: Finished difference Result 931 states and 1415 transitions. [2022-02-20 18:52:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1415 transitions. [2022-02-20 18:52:13,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:13,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:13,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 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 931 states. [2022-02-20 18:52:13,630 INFO L87 Difference]: Start difference. First operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 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 931 states. [2022-02-20 18:52:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:13,656 INFO L93 Difference]: Finished difference Result 931 states and 1415 transitions. [2022-02-20 18:52:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1415 transitions. [2022-02-20 18:52:13,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:13,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:13,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:13,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1414 transitions. [2022-02-20 18:52:13,693 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1414 transitions. Word has length 64 [2022-02-20 18:52:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:13,693 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1414 transitions. [2022-02-20 18:52:13,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1414 transitions. [2022-02-20 18:52:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:13,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:13,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:13,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:52:13,694 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:13,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1017922373, now seen corresponding path program 1 times [2022-02-20 18:52:13,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:13,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393674126] [2022-02-20 18:52:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:13,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {16025#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {16025#true} is VALID [2022-02-20 18:52:13,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {16025#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_~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_~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_~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;havoc main_~init__tmp~0#1; {16025#true} is VALID [2022-02-20 18:52:13,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {16025#true} assume 0 == ~r1~0; {16025#true} is VALID [2022-02-20 18:52:13,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {16025#true} assume ~id1~0 >= 0; {16025#true} is VALID [2022-02-20 18:52:13,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {16025#true} assume 0 == ~st1~0; {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:13,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:13,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:13,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:13,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:13,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:13,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:13,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:13,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:13,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:13,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:13,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:13,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 >= 4); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,893 INFO L290 TraceCheckUtils]: 46: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,896 INFO L290 TraceCheckUtils]: 52: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 >= 4); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:13,901 INFO L290 TraceCheckUtils]: 60: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {16026#false} is VALID [2022-02-20 18:52:13,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {16026#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {16026#false} is VALID [2022-02-20 18:52:13,906 INFO L290 TraceCheckUtils]: 62: Hoare triple {16026#false} assume 0 == main_~assert__arg~1#1 % 256; {16026#false} is VALID [2022-02-20 18:52:13,907 INFO L290 TraceCheckUtils]: 63: Hoare triple {16026#false} assume !false; {16026#false} is VALID [2022-02-20 18:52:13,908 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:13,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:13,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393674126] [2022-02-20 18:52:13,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393674126] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:13,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:13,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:13,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255561358] [2022-02-20 18:52:13,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:13,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:13,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:13,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:13,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:13,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:13,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:13,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:13,957 INFO L87 Difference]: Start difference. First operand 929 states and 1414 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:15,367 INFO L93 Difference]: Finished difference Result 1757 states and 2692 transitions. [2022-02-20 18:52:15,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:15,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 347 transitions. [2022-02-20 18:52:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 347 transitions. [2022-02-20 18:52:15,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 347 transitions. [2022-02-20 18:52:15,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:15,606 INFO L225 Difference]: With dead ends: 1757 [2022-02-20 18:52:15,607 INFO L226 Difference]: Without dead ends: 931 [2022-02-20 18:52:15,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:52:15,608 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 426 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:15,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 517 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-02-20 18:52:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2022-02-20 18:52:16,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:16,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call 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:16,521 INFO L74 IsIncluded]: Start isIncluded. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call 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:16,522 INFO L87 Difference]: Start difference. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call 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:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:16,549 INFO L93 Difference]: Finished difference Result 931 states and 1410 transitions. [2022-02-20 18:52:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1410 transitions. [2022-02-20 18:52:16,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:16,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:16,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 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 931 states. [2022-02-20 18:52:16,554 INFO L87 Difference]: Start difference. First operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 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 931 states. [2022-02-20 18:52:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:16,581 INFO L93 Difference]: Finished difference Result 931 states and 1410 transitions. [2022-02-20 18:52:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1410 transitions. [2022-02-20 18:52:16,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:16,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:16,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:16,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call 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:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1409 transitions. [2022-02-20 18:52:16,617 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1409 transitions. Word has length 64 [2022-02-20 18:52:16,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:16,617 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1409 transitions. [2022-02-20 18:52:16,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1409 transitions. [2022-02-20 18:52:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:16,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:16,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:16,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:16,619 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:16,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash 145774506, now seen corresponding path program 1 times [2022-02-20 18:52:16,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:16,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948192102] [2022-02-20 18:52:16,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:16,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:16,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {21608#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {21608#true} is VALID [2022-02-20 18:52:16,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {21608#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_~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_~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_~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;havoc main_~init__tmp~0#1; {21608#true} is VALID [2022-02-20 18:52:16,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {21608#true} assume 0 == ~r1~0; {21608#true} is VALID [2022-02-20 18:52:16,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {21608#true} assume ~id1~0 >= 0; {21608#true} is VALID [2022-02-20 18:52:16,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {21608#true} assume 0 == ~st1~0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:16,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {21610#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:16,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {21610#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:16,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {21610#(<= ~st1~0 0)} assume ~id2~0 >= 0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:16,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {21610#(<= ~st1~0 0)} assume 0 == ~st2~0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:16,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {21610#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:16,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {21610#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:16,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {21610#(<= ~st1~0 0)} assume ~id3~0 >= 0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:52:16,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {21610#(<= ~st1~0 0)} assume 0 == ~st3~0; {21611#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {21611#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {21611#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {21611#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {21611#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {21611#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {21611#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {21611#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {21612#(<= (+ ~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;main_~main__i2~0#1 := 0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {21612#(<= (+ ~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; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {21612#(<= (+ ~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; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {21612#(<= (+ ~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; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {21612#(<= (+ ~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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {21612#(<= (+ ~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; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {21612#(<= (+ ~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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {21612#(<= (+ ~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; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:52:16,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:16,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:16,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:16,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:16,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:16,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:16,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:16,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:16,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:52:16,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {21609#false} is VALID [2022-02-20 18:52:16,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {21609#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {21609#false} is VALID [2022-02-20 18:52:16,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {21609#false} assume 0 == main_~assert__arg~1#1 % 256; {21609#false} is VALID [2022-02-20 18:52:16,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {21609#false} assume !false; {21609#false} is VALID [2022-02-20 18:52:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:16,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:16,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948192102] [2022-02-20 18:52:16,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948192102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:16,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:16,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:16,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788075500] [2022-02-20 18:52:16,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:16,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:16,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:16,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:16,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:16,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:16,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:16,764 INFO L87 Difference]: Start difference. First operand 929 states and 1409 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,832 INFO L93 Difference]: Finished difference Result 1689 states and 2577 transitions. [2022-02-20 18:52:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:18,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:52:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions. [2022-02-20 18:52:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions. [2022-02-20 18:52:18,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 614 transitions. [2022-02-20 18:52:19,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,180 INFO L225 Difference]: With dead ends: 1689 [2022-02-20 18:52:19,180 INFO L226 Difference]: Without dead ends: 1504 [2022-02-20 18:52:19,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:19,182 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 643 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:19,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 937 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-02-20 18:52:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1123. [2022-02-20 18:52:19,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:19,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1504 states. Second operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,988 INFO L74 IsIncluded]: Start isIncluded. First operand 1504 states. Second operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,995 INFO L87 Difference]: Start difference. First operand 1504 states. Second operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:20,050 INFO L93 Difference]: Finished difference Result 1504 states and 2290 transitions. [2022-02-20 18:52:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2290 transitions. [2022-02-20 18:52:20,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:20,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:20,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 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 1504 states. [2022-02-20 18:52:20,055 INFO L87 Difference]: Start difference. First operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 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 1504 states. [2022-02-20 18:52:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:20,110 INFO L93 Difference]: Finished difference Result 1504 states and 2290 transitions. [2022-02-20 18:52:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2290 transitions. [2022-02-20 18:52:20,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:20,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:20,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:20,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1708 transitions. [2022-02-20 18:52:20,157 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1708 transitions. Word has length 64 [2022-02-20 18:52:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:20,158 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1708 transitions. [2022-02-20 18:52:20,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1708 transitions. [2022-02-20 18:52:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:20,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:20,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:20,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:20,159 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:20,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1968503380, now seen corresponding path program 1 times [2022-02-20 18:52:20,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:20,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886467758] [2022-02-20 18:52:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:20,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {28511#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {28513#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:20,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {28513#(<= (+ ~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_~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_~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_~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;havoc main_~init__tmp~0#1; {28513#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:20,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {28513#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {28513#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:20,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {28513#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {28514#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:20,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {28514#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {28514#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:20,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {28514#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {28512#false} is VALID [2022-02-20 18:52:20,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {28512#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; {28512#false} is VALID [2022-02-20 18:52:20,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {28512#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {28512#false} is VALID [2022-02-20 18:52:20,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {28512#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {28512#false} is VALID [2022-02-20 18:52:20,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {28512#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; {28512#false} is VALID [2022-02-20 18:52:20,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {28512#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {28512#false} is VALID [2022-02-20 18:52:20,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {28512#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {28512#false} is VALID [2022-02-20 18:52:20,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {28512#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; {28512#false} is VALID [2022-02-20 18:52:20,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {28512#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {28512#false} is VALID [2022-02-20 18:52:20,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {28512#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {28512#false} is VALID [2022-02-20 18:52:20,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {28512#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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {28512#false} is VALID [2022-02-20 18:52:20,222 INFO L290 TraceCheckUtils]: 39: Hoare triple {28512#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {28512#false} is VALID [2022-02-20 18:52:20,222 INFO L290 TraceCheckUtils]: 40: Hoare triple {28512#false} assume !(~r1~0 >= 4); {28512#false} is VALID [2022-02-20 18:52:20,222 INFO L290 TraceCheckUtils]: 41: Hoare triple {28512#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {28512#false} is VALID [2022-02-20 18:52:20,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {28512#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {28512#false} is VALID [2022-02-20 18:52:20,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {28512#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; {28512#false} is VALID [2022-02-20 18:52:20,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {28512#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:52:20,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {28512#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:52:20,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {28512#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {28512#false} is VALID [2022-02-20 18:52:20,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {28512#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:52:20,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {28512#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:52:20,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {28512#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {28512#false} is VALID [2022-02-20 18:52:20,223 INFO L290 TraceCheckUtils]: 50: Hoare triple {28512#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:52:20,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {28512#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:52:20,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {28512#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {28512#false} is VALID [2022-02-20 18:52:20,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {28512#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:52:20,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {28512#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:52:20,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {28512#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {28512#false} is VALID [2022-02-20 18:52:20,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {28512#false} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {28512#false} is VALID [2022-02-20 18:52:20,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {28512#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {28512#false} is VALID [2022-02-20 18:52:20,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {28512#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {28512#false} is VALID [2022-02-20 18:52:20,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {28512#false} assume ~r1~0 >= 4; {28512#false} is VALID [2022-02-20 18:52:20,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {28512#false} assume !(~r1~0 < 4); {28512#false} is VALID [2022-02-20 18:52:20,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {28512#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {28512#false} is VALID [2022-02-20 18:52:20,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {28512#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {28512#false} is VALID [2022-02-20 18:52:20,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {28512#false} assume 0 == main_~assert__arg~1#1 % 256; {28512#false} is VALID [2022-02-20 18:52:20,225 INFO L290 TraceCheckUtils]: 64: Hoare triple {28512#false} assume !false; {28512#false} is VALID [2022-02-20 18:52:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:20,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:20,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886467758] [2022-02-20 18:52:20,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886467758] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:20,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:20,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:20,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204118796] [2022-02-20 18:52:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:20,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:20,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:20,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:20,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:20,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:20,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:20,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:20,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:20,257 INFO L87 Difference]: Start difference. First operand 1123 states and 1708 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:21,764 INFO L93 Difference]: Finished difference Result 2216 states and 3385 transitions. [2022-02-20 18:52:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:21,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:52:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:52:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:52:21,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 299 transitions. [2022-02-20 18:52:21,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:22,008 INFO L225 Difference]: With dead ends: 2216 [2022-02-20 18:52:22,008 INFO L226 Difference]: Without dead ends: 1123 [2022-02-20 18:52:22,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:22,010 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 447 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:22,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 89 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-02-20 18:52:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2022-02-20 18:52:23,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:23,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.5017825311942958) internal successors, (1685), 1122 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call 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:23,428 INFO L74 IsIncluded]: Start isIncluded. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.5017825311942958) internal successors, (1685), 1122 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call 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:23,430 INFO L87 Difference]: Start difference. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.5017825311942958) internal successors, (1685), 1122 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call 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:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,464 INFO L93 Difference]: Finished difference Result 1123 states and 1685 transitions. [2022-02-20 18:52:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1685 transitions. [2022-02-20 18:52:23,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:23,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:23,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 1122 states have (on average 1.5017825311942958) internal successors, (1685), 1122 states have internal predecessors, (1685), 0 states have call successors, (0), 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 1123 states. [2022-02-20 18:52:23,467 INFO L87 Difference]: Start difference. First operand has 1123 states, 1122 states have (on average 1.5017825311942958) internal successors, (1685), 1122 states have internal predecessors, (1685), 0 states have call successors, (0), 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 1123 states. [2022-02-20 18:52:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,503 INFO L93 Difference]: Finished difference Result 1123 states and 1685 transitions. [2022-02-20 18:52:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1685 transitions. [2022-02-20 18:52:23,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:23,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:23,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:23,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.5017825311942958) internal successors, (1685), 1122 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call 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:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1685 transitions. [2022-02-20 18:52:23,550 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1685 transitions. Word has length 65 [2022-02-20 18:52:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:23,551 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1685 transitions. [2022-02-20 18:52:23,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1685 transitions. [2022-02-20 18:52:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:23,551 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:23,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:23,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:23,552 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1032507974, now seen corresponding path program 1 times [2022-02-20 18:52:23,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:23,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674905244] [2022-02-20 18:52:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:23,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {35376#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {35378#(<= (+ ~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_~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_~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_~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;havoc main_~init__tmp~0#1; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {35378#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {35378#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {35379#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:23,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {35379#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {35379#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:23,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {35379#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~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; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~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; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~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; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {35380#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:23,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {35380#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {35377#false} is VALID [2022-02-20 18:52:23,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {35377#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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {35377#false} is VALID [2022-02-20 18:52:23,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {35377#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {35377#false} is VALID [2022-02-20 18:52:23,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {35377#false} assume !(~r1~0 >= 4); {35377#false} is VALID [2022-02-20 18:52:23,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {35377#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {35377#false} is VALID [2022-02-20 18:52:23,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {35377#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {35377#false} is VALID [2022-02-20 18:52:23,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {35377#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; {35377#false} is VALID [2022-02-20 18:52:23,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {35377#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35377#false} is VALID [2022-02-20 18:52:23,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {35377#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {35377#false} is VALID [2022-02-20 18:52:23,611 INFO L290 TraceCheckUtils]: 47: Hoare triple {35377#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {35377#false} is VALID [2022-02-20 18:52:23,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {35377#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {35377#false} is VALID [2022-02-20 18:52:23,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {35377#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {35377#false} is VALID [2022-02-20 18:52:23,611 INFO L290 TraceCheckUtils]: 50: Hoare triple {35377#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {35377#false} is VALID [2022-02-20 18:52:23,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {35377#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {35377#false} is VALID [2022-02-20 18:52:23,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {35377#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {35377#false} is VALID [2022-02-20 18:52:23,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {35377#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {35377#false} is VALID [2022-02-20 18:52:23,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {35377#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {35377#false} is VALID [2022-02-20 18:52:23,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {35377#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {35377#false} is VALID [2022-02-20 18:52:23,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {35377#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {35377#false} is VALID [2022-02-20 18:52:23,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {35377#false} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {35377#false} is VALID [2022-02-20 18:52:23,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {35377#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {35377#false} is VALID [2022-02-20 18:52:23,613 INFO L290 TraceCheckUtils]: 59: Hoare triple {35377#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {35377#false} is VALID [2022-02-20 18:52:23,613 INFO L290 TraceCheckUtils]: 60: Hoare triple {35377#false} assume ~r1~0 >= 4; {35377#false} is VALID [2022-02-20 18:52:23,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {35377#false} assume !(~r1~0 < 4); {35377#false} is VALID [2022-02-20 18:52:23,613 INFO L290 TraceCheckUtils]: 62: Hoare triple {35377#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {35377#false} is VALID [2022-02-20 18:52:23,613 INFO L290 TraceCheckUtils]: 63: Hoare triple {35377#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {35377#false} is VALID [2022-02-20 18:52:23,613 INFO L290 TraceCheckUtils]: 64: Hoare triple {35377#false} assume 0 == main_~assert__arg~1#1 % 256; {35377#false} is VALID [2022-02-20 18:52:23,613 INFO L290 TraceCheckUtils]: 65: Hoare triple {35377#false} assume !false; {35377#false} is VALID [2022-02-20 18:52:23,613 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:23,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:23,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674905244] [2022-02-20 18:52:23,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674905244] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:23,614 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:23,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:23,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039561708] [2022-02-20 18:52:23,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:23,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:52:23,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:23,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:23,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:23,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:23,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:23,651 INFO L87 Difference]: Start difference. First operand 1123 states and 1685 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:25,528 INFO L93 Difference]: Finished difference Result 2204 states and 3325 transitions. [2022-02-20 18:52:25,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:25,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:52:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 281 transitions. [2022-02-20 18:52:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 281 transitions. [2022-02-20 18:52:25,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 281 transitions. [2022-02-20 18:52:25,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:25,761 INFO L225 Difference]: With dead ends: 2204 [2022-02-20 18:52:25,761 INFO L226 Difference]: Without dead ends: 1123 [2022-02-20 18:52:25,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:25,764 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 407 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:25,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 113 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-02-20 18:52:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2022-02-20 18:52:27,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:27,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.481283422459893) internal successors, (1662), 1122 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call 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:27,308 INFO L74 IsIncluded]: Start isIncluded. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.481283422459893) internal successors, (1662), 1122 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call 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:27,308 INFO L87 Difference]: Start difference. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.481283422459893) internal successors, (1662), 1122 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call 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:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:27,343 INFO L93 Difference]: Finished difference Result 1123 states and 1662 transitions. [2022-02-20 18:52:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1662 transitions. [2022-02-20 18:52:27,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:27,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:27,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 1122 states have (on average 1.481283422459893) internal successors, (1662), 1122 states have internal predecessors, (1662), 0 states have call successors, (0), 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 1123 states. [2022-02-20 18:52:27,346 INFO L87 Difference]: Start difference. First operand has 1123 states, 1122 states have (on average 1.481283422459893) internal successors, (1662), 1122 states have internal predecessors, (1662), 0 states have call successors, (0), 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 1123 states. [2022-02-20 18:52:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:27,381 INFO L93 Difference]: Finished difference Result 1123 states and 1662 transitions. [2022-02-20 18:52:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1662 transitions. [2022-02-20 18:52:27,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:27,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:27,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:27,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.481283422459893) internal successors, (1662), 1122 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call 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:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1662 transitions. [2022-02-20 18:52:27,427 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1662 transitions. Word has length 66 [2022-02-20 18:52:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:27,427 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1662 transitions. [2022-02-20 18:52:27,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1662 transitions. [2022-02-20 18:52:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:52:27,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:27,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:27,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:27,430 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:27,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1666418400, now seen corresponding path program 1 times [2022-02-20 18:52:27,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:27,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134755103] [2022-02-20 18:52:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:27,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {42226#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {42228#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {42228#(<= (+ ~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_~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_~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_~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;havoc main_~init__tmp~0#1; {42228#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {42228#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {42228#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {42228#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {42228#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {42228#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {42228#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {42228#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {42228#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {42228#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {42228#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {42228#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {42229#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:27,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {42229#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {42229#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:27,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {42229#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~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; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {42230#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {42230#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {42227#false} is VALID [2022-02-20 18:52:27,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {42227#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; {42227#false} is VALID [2022-02-20 18:52:27,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {42227#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {42227#false} is VALID [2022-02-20 18:52:27,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {42227#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {42227#false} is VALID [2022-02-20 18:52:27,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {42227#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; {42227#false} is VALID [2022-02-20 18:52:27,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {42227#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {42227#false} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {42227#false} assume ~send4~0 != ~nomsg~0; {42227#false} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {42227#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {42227#false} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {42227#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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {42227#false} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {42227#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {42227#false} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {42227#false} assume !(~r1~0 >= 4); {42227#false} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {42227#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {42227#false} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {42227#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {42227#false} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {42227#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; {42227#false} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {42227#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {42227#false} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {42227#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {42227#false} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {42227#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {42227#false} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 49: Hoare triple {42227#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {42227#false} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {42227#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {42227#false} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {42227#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {42227#false} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {42227#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {42227#false} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {42227#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {42227#false} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 54: Hoare triple {42227#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {42227#false} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {42227#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {42227#false} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {42227#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {42227#false} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 57: Hoare triple {42227#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {42227#false} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 58: Hoare triple {42227#false} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {42227#false} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 59: Hoare triple {42227#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {42227#false} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 60: Hoare triple {42227#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {42227#false} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {42227#false} assume ~r1~0 >= 4; {42227#false} is VALID [2022-02-20 18:52:27,497 INFO L290 TraceCheckUtils]: 62: Hoare triple {42227#false} assume !(~r1~0 < 4); {42227#false} is VALID [2022-02-20 18:52:27,497 INFO L290 TraceCheckUtils]: 63: Hoare triple {42227#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {42227#false} is VALID [2022-02-20 18:52:27,497 INFO L290 TraceCheckUtils]: 64: Hoare triple {42227#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {42227#false} is VALID [2022-02-20 18:52:27,497 INFO L290 TraceCheckUtils]: 65: Hoare triple {42227#false} assume 0 == main_~assert__arg~1#1 % 256; {42227#false} is VALID [2022-02-20 18:52:27,497 INFO L290 TraceCheckUtils]: 66: Hoare triple {42227#false} assume !false; {42227#false} is VALID [2022-02-20 18:52:27,497 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:27,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:27,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134755103] [2022-02-20 18:52:27,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134755103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:27,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:27,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:27,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149987519] [2022-02-20 18:52:27,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:27,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:52:27,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:27,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:27,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:27,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:27,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:27,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:27,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:27,543 INFO L87 Difference]: Start difference. First operand 1123 states and 1662 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:29,393 INFO L93 Difference]: Finished difference Result 2212 states and 3289 transitions. [2022-02-20 18:52:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 18:52:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 287 transitions. [2022-02-20 18:52:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 287 transitions. [2022-02-20 18:52:29,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 287 transitions. [2022-02-20 18:52:29,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:29,607 INFO L225 Difference]: With dead ends: 2212 [2022-02-20 18:52:29,607 INFO L226 Difference]: Without dead ends: 1123 [2022-02-20 18:52:29,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:29,609 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 423 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:29,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 97 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:29,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-02-20 18:52:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2022-02-20 18:52:31,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:31,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.4607843137254901) internal successors, (1639), 1122 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,761 INFO L74 IsIncluded]: Start isIncluded. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.4607843137254901) internal successors, (1639), 1122 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,762 INFO L87 Difference]: Start difference. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.4607843137254901) internal successors, (1639), 1122 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,796 INFO L93 Difference]: Finished difference Result 1123 states and 1639 transitions. [2022-02-20 18:52:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1639 transitions. [2022-02-20 18:52:31,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 1122 states have (on average 1.4607843137254901) internal successors, (1639), 1122 states have internal predecessors, (1639), 0 states have call successors, (0), 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 1123 states. [2022-02-20 18:52:31,799 INFO L87 Difference]: Start difference. First operand has 1123 states, 1122 states have (on average 1.4607843137254901) internal successors, (1639), 1122 states have internal predecessors, (1639), 0 states have call successors, (0), 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 1123 states. [2022-02-20 18:52:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,831 INFO L93 Difference]: Finished difference Result 1123 states and 1639 transitions. [2022-02-20 18:52:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1639 transitions. [2022-02-20 18:52:31,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:31,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4607843137254901) internal successors, (1639), 1122 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1639 transitions. [2022-02-20 18:52:31,887 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1639 transitions. Word has length 67 [2022-02-20 18:52:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:31,888 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1639 transitions. [2022-02-20 18:52:31,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1639 transitions. [2022-02-20 18:52:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:52:31,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:31,889 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] [2022-02-20 18:52:31,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:31,890 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1540735366, now seen corresponding path program 1 times [2022-02-20 18:52:31,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:31,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941705469] [2022-02-20 18:52:31,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:31,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {49086#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {49088#(<= (+ ~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_~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_~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_~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;havoc main_~init__tmp~0#1; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {49088#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {49088#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {49089#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:31,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {49089#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {49089#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:31,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {49089#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~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; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~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; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {49090#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:31,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {49090#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {49087#false} is VALID [2022-02-20 18:52:31,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {49087#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; {49087#false} is VALID [2022-02-20 18:52:31,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {49087#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {49087#false} is VALID [2022-02-20 18:52:31,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {49087#false} assume ~send4~0 != ~nomsg~0; {49087#false} is VALID [2022-02-20 18:52:31,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {49087#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {49087#false} is VALID [2022-02-20 18:52:31,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {49087#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;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {49087#false} is VALID [2022-02-20 18:52:31,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {49087#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {49087#false} is VALID [2022-02-20 18:52:31,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {49087#false} assume !(~r1~0 >= 4); {49087#false} is VALID [2022-02-20 18:52:31,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {49087#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {49087#false} is VALID [2022-02-20 18:52:31,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {49087#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {49087#false} is VALID [2022-02-20 18:52:31,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {49087#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; {49087#false} is VALID [2022-02-20 18:52:31,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {49087#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {49087#false} is VALID [2022-02-20 18:52:31,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {49087#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {49087#false} is VALID [2022-02-20 18:52:31,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {49087#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {49087#false} is VALID [2022-02-20 18:52:31,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {49087#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {49087#false} is VALID [2022-02-20 18:52:31,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {49087#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {49087#false} is VALID [2022-02-20 18:52:31,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {49087#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {49087#false} is VALID [2022-02-20 18:52:31,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {49087#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {49087#false} is VALID [2022-02-20 18:52:31,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {49087#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {49087#false} is VALID [2022-02-20 18:52:31,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {49087#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {49087#false} is VALID [2022-02-20 18:52:31,955 INFO L290 TraceCheckUtils]: 56: Hoare triple {49087#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {49087#false} is VALID [2022-02-20 18:52:31,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {49087#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {49087#false} is VALID [2022-02-20 18:52:31,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {49087#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {49087#false} is VALID [2022-02-20 18:52:31,956 INFO L290 TraceCheckUtils]: 59: Hoare triple {49087#false} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {49087#false} is VALID [2022-02-20 18:52:31,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {49087#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {49087#false} is VALID [2022-02-20 18:52:31,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {49087#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {49087#false} is VALID [2022-02-20 18:52:31,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {49087#false} assume ~r1~0 >= 4; {49087#false} is VALID [2022-02-20 18:52:31,956 INFO L290 TraceCheckUtils]: 63: Hoare triple {49087#false} assume !(~r1~0 < 4); {49087#false} is VALID [2022-02-20 18:52:31,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {49087#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {49087#false} is VALID [2022-02-20 18:52:31,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {49087#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {49087#false} is VALID [2022-02-20 18:52:31,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {49087#false} assume 0 == main_~assert__arg~1#1 % 256; {49087#false} is VALID [2022-02-20 18:52:31,957 INFO L290 TraceCheckUtils]: 67: Hoare triple {49087#false} assume !false; {49087#false} is VALID [2022-02-20 18:52:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:31,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:31,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941705469] [2022-02-20 18:52:31,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941705469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:31,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:31,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:31,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659233577] [2022-02-20 18:52:31,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:31,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:52:31,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:31,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:31,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:31,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:31,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:31,996 INFO L87 Difference]: Start difference. First operand 1123 states and 1639 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call 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:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:34,453 INFO L93 Difference]: Finished difference Result 2208 states and 3239 transitions. [2022-02-20 18:52:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:52:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call 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:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2022-02-20 18:52:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call 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:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2022-02-20 18:52:34,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 279 transitions. [2022-02-20 18:52:34,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:34,674 INFO L225 Difference]: With dead ends: 2208 [2022-02-20 18:52:34,675 INFO L226 Difference]: Without dead ends: 1123 [2022-02-20 18:52:34,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:34,676 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 405 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:34,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 105 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-02-20 18:52:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2022-02-20 18:52:36,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:36,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.4402852049910873) internal successors, (1616), 1122 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,360 INFO L74 IsIncluded]: Start isIncluded. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.4402852049910873) internal successors, (1616), 1122 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,361 INFO L87 Difference]: Start difference. First operand 1123 states. Second operand has 1123 states, 1122 states have (on average 1.4402852049910873) internal successors, (1616), 1122 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,394 INFO L93 Difference]: Finished difference Result 1123 states and 1616 transitions. [2022-02-20 18:52:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1616 transitions. [2022-02-20 18:52:36,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 1122 states have (on average 1.4402852049910873) internal successors, (1616), 1122 states have internal predecessors, (1616), 0 states have call successors, (0), 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 1123 states. [2022-02-20 18:52:36,398 INFO L87 Difference]: Start difference. First operand has 1123 states, 1122 states have (on average 1.4402852049910873) internal successors, (1616), 1122 states have internal predecessors, (1616), 0 states have call successors, (0), 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 1123 states. [2022-02-20 18:52:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,439 INFO L93 Difference]: Finished difference Result 1123 states and 1616 transitions. [2022-02-20 18:52:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1616 transitions. [2022-02-20 18:52:36,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:36,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4402852049910873) internal successors, (1616), 1122 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1616 transitions. [2022-02-20 18:52:36,485 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1616 transitions. Word has length 68 [2022-02-20 18:52:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:36,485 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1616 transitions. [2022-02-20 18:52:36,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1616 transitions. [2022-02-20 18:52:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:52:36,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:36,487 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] [2022-02-20 18:52:36,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:36,487 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash -147544852, now seen corresponding path program 1 times [2022-02-20 18:52:36,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:36,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4532118] [2022-02-20 18:52:36,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:36,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {55941#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {55943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:36,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {55943#(<= (+ ~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_~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_~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_~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;havoc main_~init__tmp~0#1; {55944#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {55944#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {55944#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {55944#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {55945#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {55945#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {55945#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {55945#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {55946#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {55947#(and (<= (+ ~nomsg~0 1) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 127) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|))} is VALID [2022-02-20 18:52:36,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {55947#(and (<= (+ ~nomsg~0 1) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 127) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|))} ~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; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send2~0 != ~nomsg~0; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send3~0 != ~nomsg~0; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send4~0 != ~nomsg~0; {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {55948#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {55949#(or (and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)))) (and (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) (- 256) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|)))) (or (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|))) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127))))))} is VALID [2022-02-20 18:52:36,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {55949#(or (and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)))) (and (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) (- 256) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|)))) (or (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|))) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127))))))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(~r1~0 >= 4); {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {55950#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {55951#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} is VALID [2022-02-20 18:52:36,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {55951#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {55952#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:36,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {55952#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {55952#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:36,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {55952#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {55953#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:52:36,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {55953#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {55942#false} is VALID [2022-02-20 18:52:36,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {55942#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {55942#false} is VALID [2022-02-20 18:52:36,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {55942#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {55942#false} is VALID [2022-02-20 18:52:36,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {55942#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {55942#false} is VALID [2022-02-20 18:52:36,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {55942#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {55942#false} is VALID [2022-02-20 18:52:36,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {55942#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {55942#false} is VALID [2022-02-20 18:52:36,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {55942#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {55942#false} is VALID [2022-02-20 18:52:36,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {55942#false} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {55942#false} is VALID [2022-02-20 18:52:36,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {55942#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {55942#false} is VALID [2022-02-20 18:52:36,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {55942#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {55942#false} is VALID [2022-02-20 18:52:36,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {55942#false} assume ~r1~0 >= 4; {55942#false} is VALID [2022-02-20 18:52:36,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {55942#false} assume !(~r1~0 < 4); {55942#false} is VALID [2022-02-20 18:52:36,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {55942#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {55942#false} is VALID [2022-02-20 18:52:36,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {55942#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {55942#false} is VALID [2022-02-20 18:52:36,735 INFO L290 TraceCheckUtils]: 67: Hoare triple {55942#false} assume 0 == main_~assert__arg~1#1 % 256; {55942#false} is VALID [2022-02-20 18:52:36,735 INFO L290 TraceCheckUtils]: 68: Hoare triple {55942#false} assume !false; {55942#false} is VALID [2022-02-20 18:52:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:36,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:36,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4532118] [2022-02-20 18:52:36,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4532118] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:36,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:36,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:52:36,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828086455] [2022-02-20 18:52:36,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:36,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:52:36,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:36,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:36,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:52:36,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:52:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:52:36,783 INFO L87 Difference]: Start difference. First operand 1123 states and 1616 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,063 INFO L93 Difference]: Finished difference Result 3260 states and 4706 transitions. [2022-02-20 18:52:44,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:52:44,064 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:52:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 353 transitions. [2022-02-20 18:52:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 353 transitions. [2022-02-20 18:52:44,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 353 transitions. [2022-02-20 18:52:44,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:44,425 INFO L225 Difference]: With dead ends: 3260 [2022-02-20 18:52:44,425 INFO L226 Difference]: Without dead ends: 2216 [2022-02-20 18:52:44,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:52:44,426 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 1111 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:44,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1111 Valid, 454 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2022-02-20 18:52:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1123. [2022-02-20 18:52:46,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:46,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2216 states. Second operand has 1123 states, 1122 states have (on average 1.4385026737967914) internal successors, (1614), 1122 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call 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:46,820 INFO L74 IsIncluded]: Start isIncluded. First operand 2216 states. Second operand has 1123 states, 1122 states have (on average 1.4385026737967914) internal successors, (1614), 1122 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call 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:46,821 INFO L87 Difference]: Start difference. First operand 2216 states. Second operand has 1123 states, 1122 states have (on average 1.4385026737967914) internal successors, (1614), 1122 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call 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:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:46,946 INFO L93 Difference]: Finished difference Result 2216 states and 3184 transitions. [2022-02-20 18:52:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3184 transitions. [2022-02-20 18:52:46,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:46,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:46,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 1122 states have (on average 1.4385026737967914) internal successors, (1614), 1122 states have internal predecessors, (1614), 0 states have call successors, (0), 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 2216 states. [2022-02-20 18:52:46,949 INFO L87 Difference]: Start difference. First operand has 1123 states, 1122 states have (on average 1.4385026737967914) internal successors, (1614), 1122 states have internal predecessors, (1614), 0 states have call successors, (0), 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 2216 states. [2022-02-20 18:52:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:47,077 INFO L93 Difference]: Finished difference Result 2216 states and 3184 transitions. [2022-02-20 18:52:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3184 transitions. [2022-02-20 18:52:47,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:47,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:47,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:47,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4385026737967914) internal successors, (1614), 1122 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call 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:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1614 transitions. [2022-02-20 18:52:47,123 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1614 transitions. Word has length 69 [2022-02-20 18:52:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:47,123 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1614 transitions. [2022-02-20 18:52:47,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call 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:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1614 transitions. [2022-02-20 18:52:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:52:47,124 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:47,124 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] [2022-02-20 18:52:47,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:52:47,125 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash 559312961, now seen corresponding path program 1 times [2022-02-20 18:52:47,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:47,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472584517] [2022-02-20 18:52:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:47,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:47,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {66512#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {66514#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:47,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {66514#(<= (+ ~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_~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_~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_~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;havoc main_~init__tmp~0#1; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {66515#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {66516#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {66516#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {66516#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:47,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {66516#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~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; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~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; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:47,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {66517#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {66518#(and (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127) (not (= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256)))))} is VALID [2022-02-20 18:52:47,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {66518#(and (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127) (not (= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256)))))} ~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; {66519#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {66519#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {66519#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {66519#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {66519#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {66519#(not (= ~p3_new~0 ~nomsg~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {66519#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {66519#(not (= ~p3_new~0 ~nomsg~0))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,254 INFO L290 TraceCheckUtils]: 55: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {66520#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:47,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {66520#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {66521#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~1#1|))} is VALID [2022-02-20 18:52:47,256 INFO L290 TraceCheckUtils]: 63: Hoare triple {66521#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~1#1|))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {66513#false} is VALID [2022-02-20 18:52:47,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {66513#false} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {66513#false} is VALID [2022-02-20 18:52:47,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {66513#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {66513#false} is VALID [2022-02-20 18:52:47,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {66513#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {66513#false} is VALID [2022-02-20 18:52:47,257 INFO L290 TraceCheckUtils]: 67: Hoare triple {66513#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {66513#false} is VALID [2022-02-20 18:52:47,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {66513#false} assume 0 == main_~assert__arg~1#1 % 256; {66513#false} is VALID [2022-02-20 18:52:47,257 INFO L290 TraceCheckUtils]: 69: Hoare triple {66513#false} assume !false; {66513#false} is VALID [2022-02-20 18:52:47,257 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:47,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:47,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472584517] [2022-02-20 18:52:47,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472584517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:47,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:47,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:52:47,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969445350] [2022-02-20 18:52:47,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:47,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:52:47,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:47,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:47,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:47,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:52:47,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:47,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:52:47,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:52:47,304 INFO L87 Difference]: Start difference. First operand 1123 states and 1614 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:54,561 INFO L93 Difference]: Finished difference Result 3215 states and 4632 transitions. [2022-02-20 18:52:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:52:54,561 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:52:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 320 transitions. [2022-02-20 18:52:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 320 transitions. [2022-02-20 18:52:54,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 320 transitions. [2022-02-20 18:52:54,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 320 edges. 320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:55,022 INFO L225 Difference]: With dead ends: 3215 [2022-02-20 18:52:55,022 INFO L226 Difference]: Without dead ends: 2201 [2022-02-20 18:52:55,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:55,024 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 984 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:55,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [984 Valid, 301 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:52:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2022-02-20 18:52:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1123. [2022-02-20 18:52:57,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:57,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2201 states. Second operand has 1123 states, 1122 states have (on average 1.4340463458110517) internal successors, (1609), 1122 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call 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,982 INFO L74 IsIncluded]: Start isIncluded. First operand 2201 states. Second operand has 1123 states, 1122 states have (on average 1.4340463458110517) internal successors, (1609), 1122 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call 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,983 INFO L87 Difference]: Start difference. First operand 2201 states. Second operand has 1123 states, 1122 states have (on average 1.4340463458110517) internal successors, (1609), 1122 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call 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,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:58,112 INFO L93 Difference]: Finished difference Result 2201 states and 3152 transitions. [2022-02-20 18:52:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 3152 transitions. [2022-02-20 18:52:58,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:58,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:58,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 1122 states have (on average 1.4340463458110517) internal successors, (1609), 1122 states have internal predecessors, (1609), 0 states have call successors, (0), 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 2201 states. [2022-02-20 18:52:58,116 INFO L87 Difference]: Start difference. First operand has 1123 states, 1122 states have (on average 1.4340463458110517) internal successors, (1609), 1122 states have internal predecessors, (1609), 0 states have call successors, (0), 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 2201 states. [2022-02-20 18:52:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:58,239 INFO L93 Difference]: Finished difference Result 2201 states and 3152 transitions. [2022-02-20 18:52:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 3152 transitions. [2022-02-20 18:52:58,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:58,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:58,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:58,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4340463458110517) internal successors, (1609), 1122 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call 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,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1609 transitions. [2022-02-20 18:52:58,286 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1609 transitions. Word has length 70 [2022-02-20 18:52:58,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:58,286 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1609 transitions. [2022-02-20 18:52:58,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1609 transitions. [2022-02-20 18:52:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:52:58,287 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:58,287 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] [2022-02-20 18:52:58,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:52:58,288 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:58,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash -761151707, now seen corresponding path program 1 times [2022-02-20 18:52:58,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:58,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072676381] [2022-02-20 18:52:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:58,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {76996#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {76998#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:58,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {76998#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~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_~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_~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;havoc main_~init__tmp~0#1; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {76999#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {77000#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {77000#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {77000#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {77000#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} ~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; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} ~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; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 != ~nomsg~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} ~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; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 != ~nomsg~0; {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {77001#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {77002#(and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0))))} is VALID [2022-02-20 18:52:58,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {77002#(and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0))))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {77003#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:58,454 INFO L290 TraceCheckUtils]: 43: Hoare triple {77003#(not (= ~nomsg~0 ~p4_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {77003#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:58,454 INFO L290 TraceCheckUtils]: 44: Hoare triple {77003#(not (= ~nomsg~0 ~p4_old~0))} assume !(~r1~0 >= 4); {77003#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:58,454 INFO L290 TraceCheckUtils]: 45: Hoare triple {77003#(not (= ~nomsg~0 ~p4_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {77003#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:58,455 INFO L290 TraceCheckUtils]: 46: Hoare triple {77003#(not (= ~nomsg~0 ~p4_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {77003#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:58,455 INFO L290 TraceCheckUtils]: 47: Hoare triple {77003#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {77003#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:58,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {77003#(not (= ~nomsg~0 ~p4_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {77003#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:58,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {77003#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {77004#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:58,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {77004#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {76997#false} is VALID [2022-02-20 18:52:58,456 INFO L290 TraceCheckUtils]: 51: Hoare triple {76997#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {76997#false} is VALID [2022-02-20 18:52:58,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {76997#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {76997#false} is VALID [2022-02-20 18:52:58,456 INFO L290 TraceCheckUtils]: 53: Hoare triple {76997#false} assume main_~node2__m2~1#1 != ~nomsg~0; {76997#false} is VALID [2022-02-20 18:52:58,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {76997#false} assume !(main_~node2__m2~1#1 > ~id2~0); {76997#false} is VALID [2022-02-20 18:52:58,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {76997#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {76997#false} is VALID [2022-02-20 18:52:58,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {76997#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {76997#false} is VALID [2022-02-20 18:52:58,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {76997#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {76997#false} is VALID [2022-02-20 18:52:58,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {76997#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {76997#false} is VALID [2022-02-20 18:52:58,457 INFO L290 TraceCheckUtils]: 59: Hoare triple {76997#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {76997#false} is VALID [2022-02-20 18:52:58,457 INFO L290 TraceCheckUtils]: 60: Hoare triple {76997#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {76997#false} is VALID [2022-02-20 18:52:58,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {76997#false} assume main_~node4__m4~1#1 != ~nomsg~0; {76997#false} is VALID [2022-02-20 18:52:58,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {76997#false} assume !(main_~node4__m4~1#1 > ~id4~0); {76997#false} is VALID [2022-02-20 18:52:58,457 INFO L290 TraceCheckUtils]: 63: Hoare triple {76997#false} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {76997#false} is VALID [2022-02-20 18:52:58,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {76997#false} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {76997#false} is VALID [2022-02-20 18:52:58,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {76997#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {76997#false} is VALID [2022-02-20 18:52:58,458 INFO L290 TraceCheckUtils]: 66: Hoare triple {76997#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {76997#false} is VALID [2022-02-20 18:52:58,458 INFO L290 TraceCheckUtils]: 67: Hoare triple {76997#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {76997#false} is VALID [2022-02-20 18:52:58,458 INFO L290 TraceCheckUtils]: 68: Hoare triple {76997#false} assume 0 == main_~assert__arg~1#1 % 256; {76997#false} is VALID [2022-02-20 18:52:58,458 INFO L290 TraceCheckUtils]: 69: Hoare triple {76997#false} assume !false; {76997#false} is VALID [2022-02-20 18:52:58,458 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,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:58,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072676381] [2022-02-20 18:52:58,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072676381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:58,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:58,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:58,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230112433] [2022-02-20 18:52:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:58,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:52:58,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:58,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:58,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:58,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:58,508 INFO L87 Difference]: Start difference. First operand 1123 states and 1609 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:05,963 INFO L93 Difference]: Finished difference Result 3186 states and 4602 transitions. [2022-02-20 18:53:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:53:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:53:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 331 transitions. [2022-02-20 18:53:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 331 transitions. [2022-02-20 18:53:05,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 331 transitions. [2022-02-20 18:53:06,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:06,305 INFO L225 Difference]: With dead ends: 3186 [2022-02-20 18:53:06,305 INFO L226 Difference]: Without dead ends: 2137 [2022-02-20 18:53:06,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:53:06,307 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 966 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:06,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 358 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:53:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2022-02-20 18:53:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1123. [2022-02-20 18:53:09,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:09,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2137 states. Second operand has 1123 states, 1122 states have (on average 1.4331550802139037) internal successors, (1608), 1122 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call 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:09,611 INFO L74 IsIncluded]: Start isIncluded. First operand 2137 states. Second operand has 1123 states, 1122 states have (on average 1.4331550802139037) internal successors, (1608), 1122 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call 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:09,612 INFO L87 Difference]: Start difference. First operand 2137 states. Second operand has 1123 states, 1122 states have (on average 1.4331550802139037) internal successors, (1608), 1122 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call 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:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:09,728 INFO L93 Difference]: Finished difference Result 2137 states and 3079 transitions. [2022-02-20 18:53:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3079 transitions. [2022-02-20 18:53:09,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:09,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:09,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 1122 states have (on average 1.4331550802139037) internal successors, (1608), 1122 states have internal predecessors, (1608), 0 states have call successors, (0), 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 2137 states. [2022-02-20 18:53:09,731 INFO L87 Difference]: Start difference. First operand has 1123 states, 1122 states have (on average 1.4331550802139037) internal successors, (1608), 1122 states have internal predecessors, (1608), 0 states have call successors, (0), 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 2137 states. [2022-02-20 18:53:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:09,852 INFO L93 Difference]: Finished difference Result 2137 states and 3079 transitions. [2022-02-20 18:53:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3079 transitions. [2022-02-20 18:53:09,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:09,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:09,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:09,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4331550802139037) internal successors, (1608), 1122 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call 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:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1608 transitions. [2022-02-20 18:53:09,898 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1608 transitions. Word has length 70 [2022-02-20 18:53:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:09,899 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1608 transitions. [2022-02-20 18:53:09,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call 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:09,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1608 transitions. [2022-02-20 18:53:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:53:09,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:09,900 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] [2022-02-20 18:53:09,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:53:09,900 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:09,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash -795660249, now seen corresponding path program 1 times [2022-02-20 18:53:09,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:09,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984903899] [2022-02-20 18:53:09,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:09,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:10,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {87273#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_3019~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__return_3113~0 := 0; {87275#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:53:10,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {87275#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~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_~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_~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;havoc main_~init__tmp~0#1; {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {87276#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {87277#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {87277#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {87277#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {87277#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} ~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; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:10,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {87278#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {87279#(and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256))) 0)) (not (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256)) 127)))) (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256)) 256) 0)) (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256)) 127))))} is VALID [2022-02-20 18:53:10,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {87279#(and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256))) 0)) (not (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256)) 127)))) (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|) (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256)) 256) 0)) (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256)) 127))))} ~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; {87280#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:10,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {87280#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {87280#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:10,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {87280#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {87280#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:10,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {87280#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {87280#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:10,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {87280#(not (= ~nomsg~0 ~p2_new~0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {87280#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:10,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {87280#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {87280#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:10,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {87280#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {87280#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:10,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {87280#(not (= ~nomsg~0 ~p2_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {87280#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:10,065 INFO L290 TraceCheckUtils]: 42: Hoare triple {87280#(not (= ~nomsg~0 ~p2_new~0))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3019~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3019~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; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,069 INFO L290 TraceCheckUtils]: 54: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {87281#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:10,070 INFO L290 TraceCheckUtils]: 58: Hoare triple {87281#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {87282#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:53:10,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {87282#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {87274#false} is VALID [2022-02-20 18:53:10,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {87274#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {87274#false} is VALID [2022-02-20 18:53:10,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {87274#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {87274#false} is VALID [2022-02-20 18:53:10,071 INFO L290 TraceCheckUtils]: 62: Hoare triple {87274#false} assume main_~node4__m4~1#1 != ~nomsg~0; {87274#false} is VALID [2022-02-20 18:53:10,071 INFO L290 TraceCheckUtils]: 63: Hoare triple {87274#false} assume !(main_~node4__m4~1#1 > ~id4~0); {87274#false} is VALID [2022-02-20 18:53:10,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {87274#false} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {87274#false} is VALID [2022-02-20 18:53:10,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {87274#false} ~mode4~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~__tmp_3178_0~0 := main_~main____CPAchecker_TMP_0~0#1; {87274#false} is VALID [2022-02-20 18:53:10,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {87274#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3178_0~0;havoc main_~check__tmp~1#1; {87274#false} is VALID [2022-02-20 18:53:10,071 INFO L290 TraceCheckUtils]: 67: Hoare triple {87274#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {87274#false} is VALID [2022-02-20 18:53:10,071 INFO L290 TraceCheckUtils]: 68: Hoare triple {87274#false} ~__return_3186~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3186~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; {87274#false} is VALID [2022-02-20 18:53:10,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {87274#false} assume 0 == main_~assert__arg~1#1 % 256; {87274#false} is VALID [2022-02-20 18:53:10,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {87274#false} assume !false; {87274#false} is VALID [2022-02-20 18:53:10,072 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:10,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:10,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984903899] [2022-02-20 18:53:10,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984903899] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:10,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:10,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:53:10,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474835475] [2022-02-20 18:53:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:53:10,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:10,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:10,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:53:10,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:53:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:53:10,119 INFO L87 Difference]: Start difference. First operand 1123 states and 1608 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)