./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c7b2e547f39f7d53d20335ecc1b1fbde6acdc52384cb52caa86017352bf317a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:53:49,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:53:49,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:53:49,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:53:49,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:53:49,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:53:49,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:53:49,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:53:49,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:53:49,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:53:49,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:53:49,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:53:49,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:53:49,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:53:49,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:53:49,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:53:49,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:53:49,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:53:49,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:53:49,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:53:49,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:53:49,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:53:49,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:53:49,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:53:49,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:53:49,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:53:49,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:53:49,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:53:49,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:53:49,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:53:49,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:53:49,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:53:49,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:53:49,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:53:49,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:53:49,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:53:49,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:53:49,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:53:49,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:53:49,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:53:49,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:53:49,951 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:53:49,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:53:49,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:53:49,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:53:49,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:53:49,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:53:49,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:53:49,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:53:49,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:53:49,970 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:53:49,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:53:49,971 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:53:49,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:53:49,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:53:49,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:53:49,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:53:49,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:53:49,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:53:49,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:53:49,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:53:49,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:53:49,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:53:49,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:53:49,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:53:49,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:53:49,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:49,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:53:49,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:53:49,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:53:49,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:53:49,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:53:49,974 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:53:49,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:53:49,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:53:49,974 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 -> 5c7b2e547f39f7d53d20335ecc1b1fbde6acdc52384cb52caa86017352bf317a [2022-02-20 18:53:50,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:53:50,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:53:50,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:53:50,162 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:53:50,163 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:53:50,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:53:50,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd07c99e9/8a7e9db8c7594425838e8c94a08e0778/FLAG5ae6d2ecd [2022-02-20 18:53:50,592 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:53:50,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:53:50,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd07c99e9/8a7e9db8c7594425838e8c94a08e0778/FLAG5ae6d2ecd [2022-02-20 18:53:50,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd07c99e9/8a7e9db8c7594425838e8c94a08e0778 [2022-02-20 18:53:50,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:53:50,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:53:50,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:50,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:53:50,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:53:50,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:50,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a325cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50, skipping insertion in model container [2022-02-20 18:53:50,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:50,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:53:50,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:53:50,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7834,7847] [2022-02-20 18:53:50,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:50,857 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:53:50,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7834,7847] [2022-02-20 18:53:50,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:50,944 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:53:50,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50 WrapperNode [2022-02-20 18:53:50,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:50,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:50,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:53:50,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:53:50,955 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:53:50" (1/1) ... [2022-02-20 18:53:50,973 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:53:50" (1/1) ... [2022-02-20 18:53:51,013 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 616 [2022-02-20 18:53:51,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:51,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:53:51,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:53:51,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:53:51,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:51,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:51,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:51,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:51,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:51,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:51,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:51,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:53:51,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:53:51,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:53:51,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:53:51,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50" (1/1) ... [2022-02-20 18:53:51,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:51,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:53:51,081 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:53:51,095 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:53:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:53:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:53:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:53:51,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:53:51,269 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:53:51,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:53:51,810 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:53:51,816 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:53:51,820 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:53:51,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:51 BoogieIcfgContainer [2022-02-20 18:53:51,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:53:51,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:53:51,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:53:51,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:53:51,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:53:50" (1/3) ... [2022-02-20 18:53:51,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72655411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:51, skipping insertion in model container [2022-02-20 18:53:51,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:50" (2/3) ... [2022-02-20 18:53:51,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72655411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:51, skipping insertion in model container [2022-02-20 18:53:51,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:51" (3/3) ... [2022-02-20 18:53:51,828 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:53:51,832 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:53:51,832 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:53:51,872 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:53:51,876 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:53:51,876 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:53:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.7551020408163265) internal successors, (258), 148 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call 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:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:53:51,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:51,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:51,895 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1577999170, now seen corresponding path program 1 times [2022-02-20 18:53:51,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:51,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427753270] [2022-02-20 18:53:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:52,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {152#true} is VALID [2022-02-20 18:53:52,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {152#true} is VALID [2022-02-20 18:53:52,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume 0 == ~r1~0 % 256; {152#true} is VALID [2022-02-20 18:53:52,268 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} assume ~id1~0 >= 0; {152#true} is VALID [2022-02-20 18:53:52,268 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} assume 0 == ~st1~0; {154#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:52,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {154#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:52,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {154#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:52,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#(<= ~st1~0 0)} assume ~id2~0 >= 0; {154#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:52,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#(<= ~st1~0 0)} assume 0 == ~st2~0; {155#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {155#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {155#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {155#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,288 INFO L290 TraceCheckUtils]: 46: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,289 INFO L290 TraceCheckUtils]: 47: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,289 INFO L290 TraceCheckUtils]: 48: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,290 INFO L290 TraceCheckUtils]: 49: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,291 INFO L290 TraceCheckUtils]: 51: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,291 INFO L290 TraceCheckUtils]: 52: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,292 INFO L290 TraceCheckUtils]: 53: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,293 INFO L290 TraceCheckUtils]: 55: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,294 INFO L290 TraceCheckUtils]: 59: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,297 INFO L290 TraceCheckUtils]: 64: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,297 INFO L290 TraceCheckUtils]: 65: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,298 INFO L290 TraceCheckUtils]: 66: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,298 INFO L290 TraceCheckUtils]: 67: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,299 INFO L290 TraceCheckUtils]: 68: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,299 INFO L290 TraceCheckUtils]: 69: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,300 INFO L290 TraceCheckUtils]: 70: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:52,300 INFO L290 TraceCheckUtils]: 71: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {153#false} is VALID [2022-02-20 18:53:52,300 INFO L290 TraceCheckUtils]: 72: Hoare triple {153#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {153#false} is VALID [2022-02-20 18:53:52,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {153#false} assume 0 == main_~assert__arg~1#1 % 256; {153#false} is VALID [2022-02-20 18:53:52,301 INFO L290 TraceCheckUtils]: 74: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:53:52,302 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:52,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:52,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427753270] [2022-02-20 18:53:52,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427753270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:52,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:52,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:52,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371892377] [2022-02-20 18:53:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:52,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 18:53:52,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:52,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:52,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:52,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:52,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:52,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:52,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:52,382 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.7551020408163265) internal successors, (258), 148 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:54,358 INFO L93 Difference]: Finished difference Result 832 states and 1345 transitions. [2022-02-20 18:53:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:53:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 18:53:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1345 transitions. [2022-02-20 18:53:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1345 transitions. [2022-02-20 18:53:54,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1345 transitions. [2022-02-20 18:53:55,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1345 edges. 1345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:55,334 INFO L225 Difference]: With dead ends: 832 [2022-02-20 18:53:55,335 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 18:53:55,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:53:55,340 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 1621 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:55,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1621 Valid, 1874 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 18:53:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 226. [2022-02-20 18:53:55,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:55,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call 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:55,456 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call 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:55,457 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call 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:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:55,480 INFO L93 Difference]: Finished difference Result 750 states and 1150 transitions. [2022-02-20 18:53:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1150 transitions. [2022-02-20 18:53:55,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:55,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:55,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 750 states. [2022-02-20 18:53:55,486 INFO L87 Difference]: Start difference. First operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 750 states. [2022-02-20 18:53:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:55,509 INFO L93 Difference]: Finished difference Result 750 states and 1150 transitions. [2022-02-20 18:53:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1150 transitions. [2022-02-20 18:53:55,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:55,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:55,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:55,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call 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:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2022-02-20 18:53:55,516 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 75 [2022-02-20 18:53:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:55,517 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2022-02-20 18:53:55,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2022-02-20 18:53:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:55,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:55,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:55,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:53:55,519 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1882204162, now seen corresponding path program 1 times [2022-02-20 18:53:55,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:55,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136270065] [2022-02-20 18:53:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:55,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {3080#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {3080#true} is VALID [2022-02-20 18:53:55,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {3080#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {3080#true} is VALID [2022-02-20 18:53:55,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {3080#true} assume 0 == ~r1~0 % 256; {3080#true} is VALID [2022-02-20 18:53:55,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {3080#true} assume ~id1~0 >= 0; {3080#true} is VALID [2022-02-20 18:53:55,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {3080#true} assume 0 == ~st1~0; {3082#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:55,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {3082#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {3082#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:55,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {3082#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:55,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {3082#(<= ~st1~0 0)} assume ~id2~0 >= 0; {3082#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:55,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {3082#(<= ~st1~0 0)} assume 0 == ~st2~0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,679 INFO L290 TraceCheckUtils]: 55: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:55,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:55,682 INFO L290 TraceCheckUtils]: 65: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:55,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:55,683 INFO L290 TraceCheckUtils]: 67: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:55,684 INFO L290 TraceCheckUtils]: 68: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:55,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:55,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:55,685 INFO L290 TraceCheckUtils]: 71: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode5~0 := 0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:55,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:55,686 INFO L290 TraceCheckUtils]: 73: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {3081#false} is VALID [2022-02-20 18:53:55,686 INFO L290 TraceCheckUtils]: 74: Hoare triple {3081#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {3081#false} is VALID [2022-02-20 18:53:55,686 INFO L290 TraceCheckUtils]: 75: Hoare triple {3081#false} assume 0 == main_~assert__arg~1#1 % 256; {3081#false} is VALID [2022-02-20 18:53:55,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {3081#false} assume !false; {3081#false} is VALID [2022-02-20 18:53:55,687 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:55,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:55,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136270065] [2022-02-20 18:53:55,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136270065] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:55,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:55,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:55,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942250348] [2022-02-20 18:53:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:55,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:55,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:55,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:55,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:55,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:55,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:55,747 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:57,133 INFO L93 Difference]: Finished difference Result 921 states and 1431 transitions. [2022-02-20 18:53:57,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 18:53:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 18:53:57,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 867 transitions. [2022-02-20 18:53:57,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 867 edges. 867 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:57,705 INFO L225 Difference]: With dead ends: 921 [2022-02-20 18:53:57,705 INFO L226 Difference]: Without dead ends: 801 [2022-02-20 18:53:57,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:57,711 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 1030 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:57,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1030 Valid, 1153 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-02-20 18:53:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 355. [2022-02-20 18:53:57,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:57,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 801 states. Second operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call 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:57,916 INFO L74 IsIncluded]: Start isIncluded. First operand 801 states. Second operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call 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:57,917 INFO L87 Difference]: Start difference. First operand 801 states. Second operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call 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:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:57,939 INFO L93 Difference]: Finished difference Result 801 states and 1239 transitions. [2022-02-20 18:53:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1239 transitions. [2022-02-20 18:53:57,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:57,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:57,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 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 801 states. [2022-02-20 18:53:57,942 INFO L87 Difference]: Start difference. First operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 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 801 states. [2022-02-20 18:53:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:57,966 INFO L93 Difference]: Finished difference Result 801 states and 1239 transitions. [2022-02-20 18:53:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1239 transitions. [2022-02-20 18:53:57,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:57,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:57,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:57,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call 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:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 535 transitions. [2022-02-20 18:53:57,975 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 535 transitions. Word has length 77 [2022-02-20 18:53:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:57,978 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 535 transitions. [2022-02-20 18:53:57,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 535 transitions. [2022-02-20 18:53:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:57,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:57,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:57,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:53:57,979 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -120044916, now seen corresponding path program 1 times [2022-02-20 18:53:57,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:57,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563473139] [2022-02-20 18:53:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:57,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:58,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {6410#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {6410#true} is VALID [2022-02-20 18:53:58,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {6410#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {6410#true} is VALID [2022-02-20 18:53:58,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {6410#true} assume 0 == ~r1~0 % 256; {6410#true} is VALID [2022-02-20 18:53:58,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {6410#true} assume ~id1~0 >= 0; {6410#true} is VALID [2022-02-20 18:53:58,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {6410#true} assume 0 == ~st1~0; {6412#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {6412#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {6412#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {6412#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {6412#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {6412#(<= ~st1~0 0)} assume ~id2~0 >= 0; {6412#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:58,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {6412#(<= ~st1~0 0)} assume 0 == ~st2~0; {6413#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {6413#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {6413#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {6413#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6413#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {6413#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {6413#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {6413#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,153 INFO L290 TraceCheckUtils]: 63: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,154 INFO L290 TraceCheckUtils]: 64: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,154 INFO L290 TraceCheckUtils]: 65: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 != ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,154 INFO L290 TraceCheckUtils]: 66: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 > ~id4~0); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:58,155 INFO L290 TraceCheckUtils]: 67: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:58,155 INFO L290 TraceCheckUtils]: 68: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:58,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:58,156 INFO L290 TraceCheckUtils]: 70: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:58,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode5~0 := 0; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:58,157 INFO L290 TraceCheckUtils]: 72: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:58,157 INFO L290 TraceCheckUtils]: 73: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {6411#false} is VALID [2022-02-20 18:53:58,157 INFO L290 TraceCheckUtils]: 74: Hoare triple {6411#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {6411#false} is VALID [2022-02-20 18:53:58,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {6411#false} assume 0 == main_~assert__arg~1#1 % 256; {6411#false} is VALID [2022-02-20 18:53:58,158 INFO L290 TraceCheckUtils]: 76: Hoare triple {6411#false} assume !false; {6411#false} is VALID [2022-02-20 18:53:58,158 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:58,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:58,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563473139] [2022-02-20 18:53:58,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563473139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:58,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:58,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:58,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929135449] [2022-02-20 18:53:58,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:58,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:58,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:58,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:58,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:58,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:58,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:58,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:58,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:58,225 INFO L87 Difference]: Start difference. First operand 355 states and 535 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:59,764 INFO L93 Difference]: Finished difference Result 1045 states and 1629 transitions. [2022-02-20 18:53:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:59,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:59,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 18:53:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call 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:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 18:53:59,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 867 transitions. [2022-02-20 18:54:00,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 867 edges. 867 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:00,316 INFO L225 Difference]: With dead ends: 1045 [2022-02-20 18:54:00,317 INFO L226 Difference]: Without dead ends: 925 [2022-02-20 18:54:00,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:54:00,319 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 1293 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:00,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1293 Valid, 1070 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-02-20 18:54:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 538. [2022-02-20 18:54:00,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:00,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 925 states. Second operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,716 INFO L74 IsIncluded]: Start isIncluded. First operand 925 states. Second operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,716 INFO L87 Difference]: Start difference. First operand 925 states. Second operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:00,744 INFO L93 Difference]: Finished difference Result 925 states and 1437 transitions. [2022-02-20 18:54:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1437 transitions. [2022-02-20 18:54:00,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:00,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:00,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 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 925 states. [2022-02-20 18:54:00,747 INFO L87 Difference]: Start difference. First operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 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 925 states. [2022-02-20 18:54:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:00,775 INFO L93 Difference]: Finished difference Result 925 states and 1437 transitions. [2022-02-20 18:54:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1437 transitions. [2022-02-20 18:54:00,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:00,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:00,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:00,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 827 transitions. [2022-02-20 18:54:00,790 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 827 transitions. Word has length 77 [2022-02-20 18:54:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:00,790 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 827 transitions. [2022-02-20 18:54:00,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 827 transitions. [2022-02-20 18:54:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:54:00,791 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:00,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:00,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:54:00,792 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1696566079, now seen corresponding path program 1 times [2022-02-20 18:54:00,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:00,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191585066] [2022-02-20 18:54:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:00,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:01,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {10414#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {10414#true} is VALID [2022-02-20 18:54:01,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {10414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {10414#true} is VALID [2022-02-20 18:54:01,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {10414#true} assume 0 == ~r1~0 % 256; {10414#true} is VALID [2022-02-20 18:54:01,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {10414#true} assume ~id1~0 >= 0; {10414#true} is VALID [2022-02-20 18:54:01,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {10414#true} assume 0 == ~st1~0; {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:54:01,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:54:01,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:54:01,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:54:01,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:54:01,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:54:01,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:54:01,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:54:01,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:01,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:01,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:01,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:01,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:01,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:01,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:01,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:01,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,043 INFO L290 TraceCheckUtils]: 47: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 5); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,045 INFO L290 TraceCheckUtils]: 52: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,046 INFO L290 TraceCheckUtils]: 54: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode1~0 % 256); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,046 INFO L290 TraceCheckUtils]: 55: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,046 INFO L290 TraceCheckUtils]: 56: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,047 INFO L290 TraceCheckUtils]: 58: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,048 INFO L290 TraceCheckUtils]: 59: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,048 INFO L290 TraceCheckUtils]: 60: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,048 INFO L290 TraceCheckUtils]: 61: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,049 INFO L290 TraceCheckUtils]: 62: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,049 INFO L290 TraceCheckUtils]: 63: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,051 INFO L290 TraceCheckUtils]: 69: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode5~0 := 0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,052 INFO L290 TraceCheckUtils]: 70: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,053 INFO L290 TraceCheckUtils]: 72: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 5); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:01,053 INFO L290 TraceCheckUtils]: 73: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);main_~check__tmp~1#1 := 0; {10415#false} is VALID [2022-02-20 18:54:01,053 INFO L290 TraceCheckUtils]: 74: Hoare triple {10415#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {10415#false} is VALID [2022-02-20 18:54:01,053 INFO L290 TraceCheckUtils]: 75: Hoare triple {10415#false} assume 0 == main_~assert__arg~1#1 % 256; {10415#false} is VALID [2022-02-20 18:54:01,053 INFO L290 TraceCheckUtils]: 76: Hoare triple {10415#false} assume !false; {10415#false} is VALID [2022-02-20 18:54:01,055 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:54:01,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:01,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191585066] [2022-02-20 18:54:01,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191585066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:01,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:01,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:54:01,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141815617] [2022-02-20 18:54:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:01,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:01,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:01,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:01,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:01,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:54:01,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:01,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:54:01,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:01,108 INFO L87 Difference]: Start difference. First operand 538 states and 827 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:02,322 INFO L93 Difference]: Finished difference Result 955 states and 1491 transitions. [2022-02-20 18:54:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:54:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 427 transitions. [2022-02-20 18:54:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 427 transitions. [2022-02-20 18:54:02,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 427 transitions. [2022-02-20 18:54:02,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:02,591 INFO L225 Difference]: With dead ends: 955 [2022-02-20 18:54:02,591 INFO L226 Difference]: Without dead ends: 540 [2022-02-20 18:54:02,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:54:02,601 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 700 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:02,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 682 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-02-20 18:54:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2022-02-20 18:54:03,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:03,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,061 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,062 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:03,073 INFO L93 Difference]: Finished difference Result 540 states and 824 transitions. [2022-02-20 18:54:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 824 transitions. [2022-02-20 18:54:03,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:03,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:03,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 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 540 states. [2022-02-20 18:54:03,076 INFO L87 Difference]: Start difference. First operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 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 540 states. [2022-02-20 18:54:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:03,086 INFO L93 Difference]: Finished difference Result 540 states and 824 transitions. [2022-02-20 18:54:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 824 transitions. [2022-02-20 18:54:03,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:03,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:03,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:03,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 823 transitions. [2022-02-20 18:54:03,100 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 823 transitions. Word has length 77 [2022-02-20 18:54:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:03,101 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 823 transitions. [2022-02-20 18:54:03,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 823 transitions. [2022-02-20 18:54:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:54:03,102 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:03,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:03,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:54:03,102 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:03,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1904417886, now seen corresponding path program 1 times [2022-02-20 18:54:03,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:03,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904927692] [2022-02-20 18:54:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:03,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:03,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {13525#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {13525#true} is VALID [2022-02-20 18:54:03,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {13525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {13525#true} is VALID [2022-02-20 18:54:03,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {13525#true} assume 0 == ~r1~0 % 256; {13525#true} is VALID [2022-02-20 18:54:03,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {13525#true} assume ~id1~0 >= 0; {13525#true} is VALID [2022-02-20 18:54:03,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {13525#true} assume 0 == ~st1~0; {13525#true} is VALID [2022-02-20 18:54:03,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {13525#true} assume ~send1~0 == ~id1~0; {13525#true} is VALID [2022-02-20 18:54:03,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {13525#true} assume 0 == ~mode1~0 % 256; {13525#true} is VALID [2022-02-20 18:54:03,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {13525#true} assume ~id2~0 >= 0; {13525#true} is VALID [2022-02-20 18:54:03,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {13525#true} assume 0 == ~st2~0; {13525#true} is VALID [2022-02-20 18:54:03,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {13525#true} assume ~send2~0 == ~id2~0; {13525#true} is VALID [2022-02-20 18:54:03,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {13525#true} assume 0 == ~mode2~0 % 256; {13525#true} is VALID [2022-02-20 18:54:03,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {13525#true} assume ~id3~0 >= 0; {13525#true} is VALID [2022-02-20 18:54:03,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {13525#true} assume 0 == ~st3~0; {13525#true} is VALID [2022-02-20 18:54:03,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {13525#true} assume ~send3~0 == ~id3~0; {13525#true} is VALID [2022-02-20 18:54:03,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {13525#true} assume 0 == ~mode3~0 % 256; {13525#true} is VALID [2022-02-20 18:54:03,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {13525#true} assume ~id4~0 >= 0; {13525#true} is VALID [2022-02-20 18:54:03,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {13525#true} assume 0 == ~st4~0; {13525#true} is VALID [2022-02-20 18:54:03,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {13525#true} assume ~send4~0 == ~id4~0; {13525#true} is VALID [2022-02-20 18:54:03,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {13525#true} assume 0 == ~mode4~0 % 256; {13525#true} is VALID [2022-02-20 18:54:03,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {13525#true} assume ~id5~0 >= 0; {13525#true} is VALID [2022-02-20 18:54:03,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {13525#true} assume 0 == ~st5~0; {13525#true} is VALID [2022-02-20 18:54:03,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {13525#true} assume ~send5~0 == ~id5~0; {13525#true} is VALID [2022-02-20 18:54:03,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {13525#true} assume 0 == ~mode5~0 % 256; {13525#true} is VALID [2022-02-20 18:54:03,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {13525#true} assume ~id1~0 != ~id2~0; {13525#true} is VALID [2022-02-20 18:54:03,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {13525#true} assume ~id1~0 != ~id3~0; {13525#true} is VALID [2022-02-20 18:54:03,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {13525#true} assume ~id1~0 != ~id4~0; {13525#true} is VALID [2022-02-20 18:54:03,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {13525#true} assume ~id1~0 != ~id5~0; {13525#true} is VALID [2022-02-20 18:54:03,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {13525#true} assume ~id2~0 != ~id3~0; {13525#true} is VALID [2022-02-20 18:54:03,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {13525#true} assume ~id2~0 != ~id4~0; {13525#true} is VALID [2022-02-20 18:54:03,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {13525#true} assume ~id2~0 != ~id5~0; {13525#true} is VALID [2022-02-20 18:54:03,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {13525#true} assume ~id3~0 != ~id4~0; {13525#true} is VALID [2022-02-20 18:54:03,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {13525#true} assume ~id3~0 != ~id5~0; {13525#true} is VALID [2022-02-20 18:54:03,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {13525#true} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {13525#true} is VALID [2022-02-20 18:54:03,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {13525#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {13525#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:54:03,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {13525#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {13525#true} is VALID [2022-02-20 18:54:03,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {13525#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; {13525#true} is VALID [2022-02-20 18:54:03,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {13525#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:54:03,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {13525#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {13525#true} is VALID [2022-02-20 18:54:03,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {13525#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; {13525#true} is VALID [2022-02-20 18:54:03,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {13525#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:54:03,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {13525#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {13525#true} is VALID [2022-02-20 18:54:03,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {13525#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; {13525#true} is VALID [2022-02-20 18:54:03,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {13525#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:54:03,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {13525#true} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {13525#true} is VALID [2022-02-20 18:54:03,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {13525#true} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {13525#true} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:54:03,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {13525#true} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {13525#true} is VALID [2022-02-20 18:54:03,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {13525#true} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13525#true} is VALID [2022-02-20 18:54:03,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {13525#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {13525#true} is VALID [2022-02-20 18:54:03,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {13525#true} assume !(~r1~0 % 256 >= 5); {13525#true} is VALID [2022-02-20 18:54:03,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {13525#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {13525#true} is VALID [2022-02-20 18:54:03,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {13525#true} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {13525#true} is VALID [2022-02-20 18:54:03,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {13525#true} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {13525#true} assume !(0 == ~mode1~0 % 256); {13525#true} is VALID [2022-02-20 18:54:03,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {13525#true} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {13525#true} assume !(main_~node1__m1~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:54:03,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {13525#true} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {13525#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,166 INFO L290 TraceCheckUtils]: 59: Hoare triple {13525#true} assume !(main_~node2__m2~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:54:03,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {13525#true} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {13525#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {13525#true} assume !(main_~node3__m3~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:54:03,167 INFO L290 TraceCheckUtils]: 63: Hoare triple {13525#true} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,168 INFO L290 TraceCheckUtils]: 64: Hoare triple {13525#true} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,168 INFO L290 TraceCheckUtils]: 65: Hoare triple {13525#true} assume !(main_~node4__m4~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:54:03,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {13525#true} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {13525#true} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:54:03,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {13525#true} assume !(main_~node5__m5~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:54:03,170 INFO L290 TraceCheckUtils]: 69: Hoare triple {13525#true} ~mode5~0 := 0; {13525#true} is VALID [2022-02-20 18:54:03,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {13525#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {13525#true} is VALID [2022-02-20 18:54:03,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {13525#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {13525#true} is VALID [2022-02-20 18:54:03,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {13525#true} assume ~r1~0 % 256 >= 5; {13527#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 4)))} is VALID [2022-02-20 18:54:03,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {13527#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 4)))} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {13526#false} is VALID [2022-02-20 18:54:03,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {13526#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {13526#false} is VALID [2022-02-20 18:54:03,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {13526#false} assume 0 == main_~assert__arg~1#1 % 256; {13526#false} is VALID [2022-02-20 18:54:03,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {13526#false} assume !false; {13526#false} is VALID [2022-02-20 18:54:03,172 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:54:03,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:03,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904927692] [2022-02-20 18:54:03,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904927692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:03,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:03,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:03,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651767434] [2022-02-20 18:54:03,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:03,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:03,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:03,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:03,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:03,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:03,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:03,213 INFO L87 Difference]: Start difference. First operand 538 states and 823 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:04,456 INFO L93 Difference]: Finished difference Result 1323 states and 2066 transitions. [2022-02-20 18:54:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:04,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-02-20 18:54:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-02-20 18:54:04,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 385 transitions. [2022-02-20 18:54:04,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:04,685 INFO L225 Difference]: With dead ends: 1323 [2022-02-20 18:54:04,685 INFO L226 Difference]: Without dead ends: 908 [2022-02-20 18:54:04,686 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:54:04,686 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 83 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:04,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 467 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:54:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-02-20 18:54:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 892. [2022-02-20 18:54:05,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:05,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 908 states. Second operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,551 INFO L74 IsIncluded]: Start isIncluded. First operand 908 states. Second operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,552 INFO L87 Difference]: Start difference. First operand 908 states. Second operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:05,577 INFO L93 Difference]: Finished difference Result 908 states and 1393 transitions. [2022-02-20 18:54:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1393 transitions. [2022-02-20 18:54:05,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:05,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:05,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 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 908 states. [2022-02-20 18:54:05,581 INFO L87 Difference]: Start difference. First operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 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 908 states. [2022-02-20 18:54:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:05,604 INFO L93 Difference]: Finished difference Result 908 states and 1393 transitions. [2022-02-20 18:54:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1393 transitions. [2022-02-20 18:54:05,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:05,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:05,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:05,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1371 transitions. [2022-02-20 18:54:05,636 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1371 transitions. Word has length 77 [2022-02-20 18:54:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:05,637 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 1371 transitions. [2022-02-20 18:54:05,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1371 transitions. [2022-02-20 18:54:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:54:05,638 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:05,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:05,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:54:05,638 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1745860562, now seen corresponding path program 1 times [2022-02-20 18:54:05,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:05,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163059154] [2022-02-20 18:54:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:05,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {18379#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {18379#true} is VALID [2022-02-20 18:54:05,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {18379#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {18379#true} is VALID [2022-02-20 18:54:05,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {18379#true} assume 0 == ~r1~0 % 256; {18379#true} is VALID [2022-02-20 18:54:05,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {18379#true} assume ~id1~0 >= 0; {18379#true} is VALID [2022-02-20 18:54:05,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {18379#true} assume 0 == ~st1~0; {18381#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:05,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {18381#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {18381#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:05,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {18381#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {18381#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:05,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {18381#(<= ~st1~0 0)} assume ~id2~0 >= 0; {18381#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:05,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {18381#(<= ~st1~0 0)} assume 0 == ~st2~0; {18382#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {18382#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {18382#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {18382#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {18382#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {18382#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {18382#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {18382#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {18384#(<= (+ ~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {18384#(<= (+ ~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,720 INFO L290 TraceCheckUtils]: 40: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,720 INFO L290 TraceCheckUtils]: 41: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {18384#(<= (+ ~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,721 INFO L290 TraceCheckUtils]: 43: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,722 INFO L290 TraceCheckUtils]: 48: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {18384#(<= (+ ~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {18384#(<= (+ ~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,726 INFO L290 TraceCheckUtils]: 59: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,726 INFO L290 TraceCheckUtils]: 60: Hoare triple {18384#(<= (+ ~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {18384#(<= (+ ~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,727 INFO L290 TraceCheckUtils]: 63: Hoare triple {18384#(<= (+ ~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {18384#(<= (+ ~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,728 INFO L290 TraceCheckUtils]: 66: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,728 INFO L290 TraceCheckUtils]: 67: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,729 INFO L290 TraceCheckUtils]: 68: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node5__m5~1#1 != ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,729 INFO L290 TraceCheckUtils]: 69: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 > ~id5~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:05,729 INFO L290 TraceCheckUtils]: 70: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node5__m5~1#1 == ~id5~0;~st5~0 := 1; {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:54:05,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} ~mode5~0 := 0; {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:54:05,730 INFO L290 TraceCheckUtils]: 72: Hoare triple {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:54:05,730 INFO L290 TraceCheckUtils]: 73: Hoare triple {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {18380#false} is VALID [2022-02-20 18:54:05,730 INFO L290 TraceCheckUtils]: 74: Hoare triple {18380#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {18380#false} is VALID [2022-02-20 18:54:05,731 INFO L290 TraceCheckUtils]: 75: Hoare triple {18380#false} assume 0 == main_~assert__arg~1#1 % 256; {18380#false} is VALID [2022-02-20 18:54:05,731 INFO L290 TraceCheckUtils]: 76: Hoare triple {18380#false} assume !false; {18380#false} is VALID [2022-02-20 18:54:05,731 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:54:05,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:05,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163059154] [2022-02-20 18:54:05,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163059154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:05,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:05,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:54:05,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936479821] [2022-02-20 18:54:05,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:05,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:05,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:05,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:05,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:05,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:54:05,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:54:05,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:05,776 INFO L87 Difference]: Start difference. First operand 892 states and 1371 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:08,366 INFO L93 Difference]: Finished difference Result 2023 states and 3143 transitions. [2022-02-20 18:54:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:54:08,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:54:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:54:08,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 866 transitions. [2022-02-20 18:54:08,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:09,036 INFO L225 Difference]: With dead ends: 2023 [2022-02-20 18:54:09,036 INFO L226 Difference]: Without dead ends: 1802 [2022-02-20 18:54:09,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:54:09,037 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 1040 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:09,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1040 Valid, 1305 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-02-20 18:54:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1112. [2022-02-20 18:54:10,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:10,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1802 states. Second operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,158 INFO L74 IsIncluded]: Start isIncluded. First operand 1802 states. Second operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,160 INFO L87 Difference]: Start difference. First operand 1802 states. Second operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:10,250 INFO L93 Difference]: Finished difference Result 1802 states and 2794 transitions. [2022-02-20 18:54:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2794 transitions. [2022-02-20 18:54:10,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:10,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:10,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 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 1802 states. [2022-02-20 18:54:10,254 INFO L87 Difference]: Start difference. First operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 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 1802 states. [2022-02-20 18:54:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:10,347 INFO L93 Difference]: Finished difference Result 1802 states and 2794 transitions. [2022-02-20 18:54:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2794 transitions. [2022-02-20 18:54:10,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:10,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:10,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:10,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1716 transitions. [2022-02-20 18:54:10,395 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1716 transitions. Word has length 77 [2022-02-20 18:54:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:10,395 INFO L470 AbstractCegarLoop]: Abstraction has 1112 states and 1716 transitions. [2022-02-20 18:54:10,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1716 transitions. [2022-02-20 18:54:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:54:10,396 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:10,396 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:10,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:54:10,396 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:10,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1856951880, now seen corresponding path program 1 times [2022-02-20 18:54:10,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:10,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954466376] [2022-02-20 18:54:10,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:10,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:10,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {26317#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {26317#true} is VALID [2022-02-20 18:54:10,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {26317#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {26317#true} is VALID [2022-02-20 18:54:10,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {26317#true} assume 0 == ~r1~0 % 256; {26317#true} is VALID [2022-02-20 18:54:10,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {26317#true} assume ~id1~0 >= 0; {26317#true} is VALID [2022-02-20 18:54:10,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {26317#true} assume 0 == ~st1~0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:10,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {26319#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:10,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {26319#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:10,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {26319#(<= ~st1~0 0)} assume ~id2~0 >= 0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:10,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {26319#(<= ~st1~0 0)} assume 0 == ~st2~0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:10,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {26319#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:10,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {26319#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:10,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {26319#(<= ~st1~0 0)} assume ~id3~0 >= 0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:10,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {26319#(<= ~st1~0 0)} assume 0 == ~st3~0; {26320#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {26320#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {26320#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {26320#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {26320#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {26320#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {26320#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {26320#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id5~0 >= 0; {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,484 INFO L290 TraceCheckUtils]: 47: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,486 INFO L290 TraceCheckUtils]: 51: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,486 INFO L290 TraceCheckUtils]: 54: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,487 INFO L290 TraceCheckUtils]: 57: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:10,489 INFO L290 TraceCheckUtils]: 61: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,489 INFO L290 TraceCheckUtils]: 63: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,490 INFO L290 TraceCheckUtils]: 66: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,491 INFO L290 TraceCheckUtils]: 67: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,491 INFO L290 TraceCheckUtils]: 68: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,491 INFO L290 TraceCheckUtils]: 69: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,492 INFO L290 TraceCheckUtils]: 70: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,492 INFO L290 TraceCheckUtils]: 71: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode5~0 := 0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,492 INFO L290 TraceCheckUtils]: 72: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:54:10,493 INFO L290 TraceCheckUtils]: 73: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {26318#false} is VALID [2022-02-20 18:54:10,493 INFO L290 TraceCheckUtils]: 74: Hoare triple {26318#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {26318#false} is VALID [2022-02-20 18:54:10,493 INFO L290 TraceCheckUtils]: 75: Hoare triple {26318#false} assume 0 == main_~assert__arg~1#1 % 256; {26318#false} is VALID [2022-02-20 18:54:10,493 INFO L290 TraceCheckUtils]: 76: Hoare triple {26318#false} assume !false; {26318#false} is VALID [2022-02-20 18:54:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:10,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:10,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954466376] [2022-02-20 18:54:10,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954466376] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:10,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:10,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:54:10,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408578967] [2022-02-20 18:54:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:10,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:10,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:10,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:10,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:54:10,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:54:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:10,538 INFO L87 Difference]: Start difference. First operand 1112 states and 1716 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:13,889 INFO L93 Difference]: Finished difference Result 2253 states and 3504 transitions. [2022-02-20 18:54:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:54:13,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:54:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:54:13,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 866 transitions. [2022-02-20 18:54:14,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:14,549 INFO L225 Difference]: With dead ends: 2253 [2022-02-20 18:54:14,549 INFO L226 Difference]: Without dead ends: 2032 [2022-02-20 18:54:14,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:54:14,550 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 1083 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:14,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1083 Valid, 1607 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-02-20 18:54:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1347. [2022-02-20 18:54:16,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:16,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2032 states. Second operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:16,186 INFO L74 IsIncluded]: Start isIncluded. First operand 2032 states. Second operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:16,188 INFO L87 Difference]: Start difference. First operand 2032 states. Second operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:16,301 INFO L93 Difference]: Finished difference Result 2032 states and 3155 transitions. [2022-02-20 18:54:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 3155 transitions. [2022-02-20 18:54:16,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:16,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:16,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 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 2032 states. [2022-02-20 18:54:16,307 INFO L87 Difference]: Start difference. First operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 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 2032 states. [2022-02-20 18:54:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:16,417 INFO L93 Difference]: Finished difference Result 2032 states and 3155 transitions. [2022-02-20 18:54:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 3155 transitions. [2022-02-20 18:54:16,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:16,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:16,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:16,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2085 transitions. [2022-02-20 18:54:16,484 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2085 transitions. Word has length 77 [2022-02-20 18:54:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:16,484 INFO L470 AbstractCegarLoop]: Abstraction has 1347 states and 2085 transitions. [2022-02-20 18:54:16,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2085 transitions. [2022-02-20 18:54:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:54:16,485 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:16,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:16,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:54:16,485 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1646651862, now seen corresponding path program 1 times [2022-02-20 18:54:16,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:16,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463589483] [2022-02-20 18:54:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:16,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {35361#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {35361#true} is VALID [2022-02-20 18:54:16,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {35361#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {35361#true} is VALID [2022-02-20 18:54:16,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {35361#true} assume 0 == ~r1~0 % 256; {35361#true} is VALID [2022-02-20 18:54:16,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {35361#true} assume ~id1~0 >= 0; {35361#true} is VALID [2022-02-20 18:54:16,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {35361#true} assume 0 == ~st1~0; {35361#true} is VALID [2022-02-20 18:54:16,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {35361#true} assume ~send1~0 == ~id1~0; {35361#true} is VALID [2022-02-20 18:54:16,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {35361#true} assume 0 == ~mode1~0 % 256; {35361#true} is VALID [2022-02-20 18:54:16,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {35361#true} assume ~id2~0 >= 0; {35361#true} is VALID [2022-02-20 18:54:16,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {35361#true} assume 0 == ~st2~0; {35363#(<= ~st2~0 0)} is VALID [2022-02-20 18:54:16,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {35363#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {35363#(<= ~st2~0 0)} is VALID [2022-02-20 18:54:16,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {35363#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {35363#(<= ~st2~0 0)} is VALID [2022-02-20 18:54:16,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {35363#(<= ~st2~0 0)} assume ~id3~0 >= 0; {35363#(<= ~st2~0 0)} is VALID [2022-02-20 18:54:16,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {35363#(<= ~st2~0 0)} assume 0 == ~st3~0; {35364#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {35364#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {35364#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {35364#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {35364#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {35364#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id4~0 >= 0; {35364#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {35364#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st4~0; {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 == ~id4~0; {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode4~0 % 256; {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id5~0 >= 0; {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send5~0 == ~id5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode5~0 % 256; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id4~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id4~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id4~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~r1~0 % 256 >= 5); {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:54:16,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,594 INFO L290 TraceCheckUtils]: 59: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,596 INFO L290 TraceCheckUtils]: 64: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,596 INFO L290 TraceCheckUtils]: 65: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,597 INFO L290 TraceCheckUtils]: 67: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,597 INFO L290 TraceCheckUtils]: 68: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode5~0 := 0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,599 INFO L290 TraceCheckUtils]: 72: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:54:16,599 INFO L290 TraceCheckUtils]: 73: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {35362#false} is VALID [2022-02-20 18:54:16,599 INFO L290 TraceCheckUtils]: 74: Hoare triple {35362#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {35362#false} is VALID [2022-02-20 18:54:16,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {35362#false} assume 0 == main_~assert__arg~1#1 % 256; {35362#false} is VALID [2022-02-20 18:54:16,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {35362#false} assume !false; {35362#false} is VALID [2022-02-20 18:54:16,600 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:54:16,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:16,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463589483] [2022-02-20 18:54:16,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463589483] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:16,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:16,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:54:16,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505552133] [2022-02-20 18:54:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:16,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:16,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:16,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:16,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:16,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:54:16,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:54:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:16,645 INFO L87 Difference]: Start difference. First operand 1347 states and 2085 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:20,864 INFO L93 Difference]: Finished difference Result 2488 states and 3873 transitions. [2022-02-20 18:54:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:54:20,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:54:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:54:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:54:20,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 866 transitions. [2022-02-20 18:54:21,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:21,575 INFO L225 Difference]: With dead ends: 2488 [2022-02-20 18:54:21,575 INFO L226 Difference]: Without dead ends: 2267 [2022-02-20 18:54:21,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:54:21,576 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 1087 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:21,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1087 Valid, 1265 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-02-20 18:54:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1582. [2022-02-20 18:54:23,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:23,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2267 states. Second operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:23,906 INFO L74 IsIncluded]: Start isIncluded. First operand 2267 states. Second operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:23,907 INFO L87 Difference]: Start difference. First operand 2267 states. Second operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:24,046 INFO L93 Difference]: Finished difference Result 2267 states and 3524 transitions. [2022-02-20 18:54:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 3524 transitions. [2022-02-20 18:54:24,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:24,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:24,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 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 2267 states. [2022-02-20 18:54:24,051 INFO L87 Difference]: Start difference. First operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 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 2267 states. [2022-02-20 18:54:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:24,191 INFO L93 Difference]: Finished difference Result 2267 states and 3524 transitions. [2022-02-20 18:54:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 3524 transitions. [2022-02-20 18:54:24,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:24,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:24,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:24,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2454 transitions. [2022-02-20 18:54:24,290 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2454 transitions. Word has length 77 [2022-02-20 18:54:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:24,290 INFO L470 AbstractCegarLoop]: Abstraction has 1582 states and 2454 transitions. [2022-02-20 18:54:24,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2454 transitions. [2022-02-20 18:54:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:54:24,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:24,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:24,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:54:24,291 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1055850175, now seen corresponding path program 1 times [2022-02-20 18:54:24,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:24,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924832160] [2022-02-20 18:54:24,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:24,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {45527#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {45529#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:24,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {45529#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {45529#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:24,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {45529#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {45529#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:24,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {45529#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {45530#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:54:24,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {45530#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {45530#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:54:24,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {45530#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:54:24,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {45528#false} is VALID [2022-02-20 18:54:24,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {45528#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; {45528#false} is VALID [2022-02-20 18:54:24,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {45528#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {45528#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {45528#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; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {45528#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {45528#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {45528#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; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {45528#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {45528#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {45528#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 46: Hoare triple {45528#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {45528#false} is VALID [2022-02-20 18:54:24,358 INFO L290 TraceCheckUtils]: 47: Hoare triple {45528#false} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {45528#false} is VALID [2022-02-20 18:54:24,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {45528#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {45528#false} is VALID [2022-02-20 18:54:24,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {45528#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {45528#false} is VALID [2022-02-20 18:54:24,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {45528#false} assume !(~r1~0 % 256 >= 5); {45528#false} is VALID [2022-02-20 18:54:24,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {45528#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {45528#false} is VALID [2022-02-20 18:54:24,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {45528#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {45528#false} is VALID [2022-02-20 18:54:24,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {45528#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {45528#false} assume !(0 == ~mode1~0 % 256); {45528#false} is VALID [2022-02-20 18:54:24,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {45528#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {45528#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {45528#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {45528#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {45528#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {45528#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {45528#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {45528#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 63: Hoare triple {45528#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 64: Hoare triple {45528#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,360 INFO L290 TraceCheckUtils]: 65: Hoare triple {45528#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {45528#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 67: Hoare triple {45528#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 68: Hoare triple {45528#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {45528#false} ~mode5~0 := 0; {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {45528#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 71: Hoare triple {45528#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 72: Hoare triple {45528#false} assume !(~r1~0 % 256 >= 5); {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 73: Hoare triple {45528#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 74: Hoare triple {45528#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {45528#false} is VALID [2022-02-20 18:54:24,361 INFO L290 TraceCheckUtils]: 75: Hoare triple {45528#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {45528#false} is VALID [2022-02-20 18:54:24,362 INFO L290 TraceCheckUtils]: 76: Hoare triple {45528#false} assume 0 == main_~assert__arg~1#1 % 256; {45528#false} is VALID [2022-02-20 18:54:24,362 INFO L290 TraceCheckUtils]: 77: Hoare triple {45528#false} assume !false; {45528#false} is VALID [2022-02-20 18:54:24,362 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:54:24,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:24,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924832160] [2022-02-20 18:54:24,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924832160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:24,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:24,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:24,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278975937] [2022-02-20 18:54:24,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:24,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:54:24,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:24,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:24,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:24,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:24,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:24,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:24,404 INFO L87 Difference]: Start difference. First operand 1582 states and 2454 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:28,077 INFO L93 Difference]: Finished difference Result 3127 states and 4870 transitions. [2022-02-20 18:54:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:28,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:54:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 366 transitions. [2022-02-20 18:54:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 366 transitions. [2022-02-20 18:54:28,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 366 transitions. [2022-02-20 18:54:28,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:28,407 INFO L225 Difference]: With dead ends: 3127 [2022-02-20 18:54:28,407 INFO L226 Difference]: Without dead ends: 1582 [2022-02-20 18:54:28,408 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:54:28,412 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 551 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:28,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 111 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2022-02-20 18:54:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2022-02-20 18:54:31,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:31,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1582 states. Second operand has 1582 states, 1581 states have (on average 1.5351043643263758) internal successors, (2427), 1581 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:31,488 INFO L74 IsIncluded]: Start isIncluded. First operand 1582 states. Second operand has 1582 states, 1581 states have (on average 1.5351043643263758) internal successors, (2427), 1581 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:31,489 INFO L87 Difference]: Start difference. First operand 1582 states. Second operand has 1582 states, 1581 states have (on average 1.5351043643263758) internal successors, (2427), 1581 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:31,563 INFO L93 Difference]: Finished difference Result 1582 states and 2427 transitions. [2022-02-20 18:54:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2427 transitions. [2022-02-20 18:54:31,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:31,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:31,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 1582 states, 1581 states have (on average 1.5351043643263758) internal successors, (2427), 1581 states have internal predecessors, (2427), 0 states have call successors, (0), 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 1582 states. [2022-02-20 18:54:31,567 INFO L87 Difference]: Start difference. First operand has 1582 states, 1581 states have (on average 1.5351043643263758) internal successors, (2427), 1581 states have internal predecessors, (2427), 0 states have call successors, (0), 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 1582 states. [2022-02-20 18:54:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:31,641 INFO L93 Difference]: Finished difference Result 1582 states and 2427 transitions. [2022-02-20 18:54:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2427 transitions. [2022-02-20 18:54:31,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:31,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:31,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:31,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5351043643263758) internal successors, (2427), 1581 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2427 transitions. [2022-02-20 18:54:31,746 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2427 transitions. Word has length 78 [2022-02-20 18:54:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:31,746 INFO L470 AbstractCegarLoop]: Abstraction has 1582 states and 2427 transitions. [2022-02-20 18:54:31,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2427 transitions. [2022-02-20 18:54:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:54:31,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:31,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:31,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:54:31,747 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:31,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2025338944, now seen corresponding path program 1 times [2022-02-20 18:54:31,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:31,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463990469] [2022-02-20 18:54:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:31,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {55196#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {55198#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:31,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {55198#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {55199#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:54:31,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {55199#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {55199#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:54:31,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {55199#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~send1~0 != ~nomsg~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~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; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~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; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~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; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {55200#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:31,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {55200#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {55197#false} is VALID [2022-02-20 18:54:31,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {55197#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {55197#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {55197#false} assume !(~r1~0 % 256 >= 5); {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {55197#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {55197#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 54: Hoare triple {55197#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 55: Hoare triple {55197#false} assume !(0 == ~mode1~0 % 256); {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 56: Hoare triple {55197#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {55197#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {55197#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {55197#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 60: Hoare triple {55197#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {55197#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {55197#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 63: Hoare triple {55197#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 64: Hoare triple {55197#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 65: Hoare triple {55197#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 66: Hoare triple {55197#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {55197#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 68: Hoare triple {55197#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {55197#false} is VALID [2022-02-20 18:54:31,825 INFO L290 TraceCheckUtils]: 69: Hoare triple {55197#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {55197#false} is VALID [2022-02-20 18:54:31,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {55197#false} ~mode5~0 := 0; {55197#false} is VALID [2022-02-20 18:54:31,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {55197#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {55197#false} is VALID [2022-02-20 18:54:31,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {55197#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {55197#false} is VALID [2022-02-20 18:54:31,826 INFO L290 TraceCheckUtils]: 73: Hoare triple {55197#false} assume !(~r1~0 % 256 >= 5); {55197#false} is VALID [2022-02-20 18:54:31,826 INFO L290 TraceCheckUtils]: 74: Hoare triple {55197#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {55197#false} is VALID [2022-02-20 18:54:31,826 INFO L290 TraceCheckUtils]: 75: Hoare triple {55197#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {55197#false} is VALID [2022-02-20 18:54:31,826 INFO L290 TraceCheckUtils]: 76: Hoare triple {55197#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {55197#false} is VALID [2022-02-20 18:54:31,826 INFO L290 TraceCheckUtils]: 77: Hoare triple {55197#false} assume 0 == main_~assert__arg~1#1 % 256; {55197#false} is VALID [2022-02-20 18:54:31,826 INFO L290 TraceCheckUtils]: 78: Hoare triple {55197#false} assume !false; {55197#false} is VALID [2022-02-20 18:54:31,827 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:54:31,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:31,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463990469] [2022-02-20 18:54:31,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463990469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:31,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:31,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:31,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223176618] [2022-02-20 18:54:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:31,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-20 18:54:31,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:31,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:31,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:31,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:31,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:31,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:31,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:31,873 INFO L87 Difference]: Start difference. First operand 1582 states and 2427 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:35,990 INFO L93 Difference]: Finished difference Result 3111 states and 4797 transitions. [2022-02-20 18:54:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-20 18:54:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2022-02-20 18:54:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2022-02-20 18:54:35,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 343 transitions. [2022-02-20 18:54:36,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:36,289 INFO L225 Difference]: With dead ends: 3111 [2022-02-20 18:54:36,289 INFO L226 Difference]: Without dead ends: 1582 [2022-02-20 18:54:36,290 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:54:36,291 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 500 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:36,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 143 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2022-02-20 18:54:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2022-02-20 18:54:39,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:39,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1582 states. Second operand has 1582 states, 1581 states have (on average 1.5180265654648957) internal successors, (2400), 1581 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:39,793 INFO L74 IsIncluded]: Start isIncluded. First operand 1582 states. Second operand has 1582 states, 1581 states have (on average 1.5180265654648957) internal successors, (2400), 1581 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:39,794 INFO L87 Difference]: Start difference. First operand 1582 states. Second operand has 1582 states, 1581 states have (on average 1.5180265654648957) internal successors, (2400), 1581 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:39,867 INFO L93 Difference]: Finished difference Result 1582 states and 2400 transitions. [2022-02-20 18:54:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2400 transitions. [2022-02-20 18:54:39,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:39,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:39,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 1582 states, 1581 states have (on average 1.5180265654648957) internal successors, (2400), 1581 states have internal predecessors, (2400), 0 states have call successors, (0), 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 1582 states. [2022-02-20 18:54:39,871 INFO L87 Difference]: Start difference. First operand has 1582 states, 1581 states have (on average 1.5180265654648957) internal successors, (2400), 1581 states have internal predecessors, (2400), 0 states have call successors, (0), 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 1582 states. [2022-02-20 18:54:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:39,940 INFO L93 Difference]: Finished difference Result 1582 states and 2400 transitions. [2022-02-20 18:54:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2400 transitions. [2022-02-20 18:54:39,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:39,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:39,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:39,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5180265654648957) internal successors, (2400), 1581 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2400 transitions. [2022-02-20 18:54:40,037 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2400 transitions. Word has length 79 [2022-02-20 18:54:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:40,037 INFO L470 AbstractCegarLoop]: Abstraction has 1582 states and 2400 transitions. [2022-02-20 18:54:40,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2400 transitions. [2022-02-20 18:54:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:54:40,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:40,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:40,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:54:40,038 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1784244513, now seen corresponding path program 1 times [2022-02-20 18:54:40,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:40,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237384165] [2022-02-20 18:54:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:40,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {64845#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {64847#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:40,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {64847#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {64848#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:54:40,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {64848#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {64848#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:54:40,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {64848#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id5~0 >= 0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~st5~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send5~0 == ~id5~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode5~0 % 256; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id5~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id5~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id5~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {64849#(<= (+ ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {64849#(<= (+ ~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; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {64849#(<= (+ ~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; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {64849#(<= (+ ~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; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {64849#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:40,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {64849#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {64846#false} is VALID [2022-02-20 18:54:40,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {64846#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {64846#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {64846#false} is VALID [2022-02-20 18:54:40,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {64846#false} assume ~send5~0 != ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {64846#false} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {64846#false} is VALID [2022-02-20 18:54:40,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {64846#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {64846#false} is VALID [2022-02-20 18:54:40,114 INFO L290 TraceCheckUtils]: 51: Hoare triple {64846#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {64846#false} is VALID [2022-02-20 18:54:40,114 INFO L290 TraceCheckUtils]: 52: Hoare triple {64846#false} assume !(~r1~0 % 256 >= 5); {64846#false} is VALID [2022-02-20 18:54:40,114 INFO L290 TraceCheckUtils]: 53: Hoare triple {64846#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {64846#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 55: Hoare triple {64846#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {64846#false} assume !(0 == ~mode1~0 % 256); {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {64846#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {64846#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {64846#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {64846#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {64846#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {64846#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {64846#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {64846#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {64846#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {64846#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {64846#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {64846#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {64846#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 70: Hoare triple {64846#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {64846#false} ~mode5~0 := 0; {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {64846#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {64846#false} is VALID [2022-02-20 18:54:40,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {64846#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {64846#false} is VALID [2022-02-20 18:54:40,117 INFO L290 TraceCheckUtils]: 74: Hoare triple {64846#false} assume !(~r1~0 % 256 >= 5); {64846#false} is VALID [2022-02-20 18:54:40,117 INFO L290 TraceCheckUtils]: 75: Hoare triple {64846#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {64846#false} is VALID [2022-02-20 18:54:40,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {64846#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {64846#false} is VALID [2022-02-20 18:54:40,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {64846#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {64846#false} is VALID [2022-02-20 18:54:40,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {64846#false} assume 0 == main_~assert__arg~1#1 % 256; {64846#false} is VALID [2022-02-20 18:54:40,117 INFO L290 TraceCheckUtils]: 79: Hoare triple {64846#false} assume !false; {64846#false} is VALID [2022-02-20 18:54:40,117 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:54:40,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:40,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237384165] [2022-02-20 18:54:40,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237384165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:40,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:40,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:40,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702634154] [2022-02-20 18:54:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:40,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:54:40,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:40,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:40,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:40,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:40,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:40,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:40,162 INFO L87 Difference]: Start difference. First operand 1582 states and 2400 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:44,742 INFO L93 Difference]: Finished difference Result 3115 states and 4748 transitions. [2022-02-20 18:54:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:54:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 344 transitions. [2022-02-20 18:54:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 344 transitions. [2022-02-20 18:54:44,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 344 transitions. [2022-02-20 18:54:44,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:45,046 INFO L225 Difference]: With dead ends: 3115 [2022-02-20 18:54:45,047 INFO L226 Difference]: Without dead ends: 1582 [2022-02-20 18:54:45,048 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:54:45,049 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 505 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:45,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 135 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2022-02-20 18:54:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2022-02-20 18:54:48,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:48,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1582 states. Second operand has 1582 states, 1581 states have (on average 1.5009487666034156) internal successors, (2373), 1581 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:48,939 INFO L74 IsIncluded]: Start isIncluded. First operand 1582 states. Second operand has 1582 states, 1581 states have (on average 1.5009487666034156) internal successors, (2373), 1581 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:48,940 INFO L87 Difference]: Start difference. First operand 1582 states. Second operand has 1582 states, 1581 states have (on average 1.5009487666034156) internal successors, (2373), 1581 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:49,014 INFO L93 Difference]: Finished difference Result 1582 states and 2373 transitions. [2022-02-20 18:54:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2373 transitions. [2022-02-20 18:54:49,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:49,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:49,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 1582 states, 1581 states have (on average 1.5009487666034156) internal successors, (2373), 1581 states have internal predecessors, (2373), 0 states have call successors, (0), 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 1582 states. [2022-02-20 18:54:49,018 INFO L87 Difference]: Start difference. First operand has 1582 states, 1581 states have (on average 1.5009487666034156) internal successors, (2373), 1581 states have internal predecessors, (2373), 0 states have call successors, (0), 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 1582 states. [2022-02-20 18:54:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:49,092 INFO L93 Difference]: Finished difference Result 1582 states and 2373 transitions. [2022-02-20 18:54:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2373 transitions. [2022-02-20 18:54:49,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:49,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:49,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:49,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5009487666034156) internal successors, (2373), 1581 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2373 transitions. [2022-02-20 18:54:49,193 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2373 transitions. Word has length 80 [2022-02-20 18:54:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:49,193 INFO L470 AbstractCegarLoop]: Abstraction has 1582 states and 2373 transitions. [2022-02-20 18:54:49,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2373 transitions. [2022-02-20 18:54:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:54:49,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:49,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:49,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:54:49,194 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:49,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash -511041836, now seen corresponding path program 1 times [2022-02-20 18:54:49,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:49,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698840868] [2022-02-20 18:54:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:49,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {74499#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6256~0 := 0;~__return_6448~0 := 0; {74501#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:49,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {74501#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {74501#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:49,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {74501#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {74501#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:49,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {74501#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {74501#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:49,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {74501#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {74501#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:49,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {74501#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {74501#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:49,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {74501#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {74501#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:49,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {74501#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {74502#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:54:49,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {74502#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {74502#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:54:49,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {74502#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id5~0 >= 0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st5~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send5~0 == ~id5~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode5~0 % 256; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id5~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id5~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id5~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {74503#(<= (+ ~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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {74503#(<= (+ ~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; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {74503#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:49,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {74503#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {74500#false} is VALID [2022-02-20 18:54:49,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {74500#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; {74500#false} is VALID [2022-02-20 18:54:49,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {74500#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {74500#false} is VALID [2022-02-20 18:54:49,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {74500#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {74500#false} is VALID [2022-02-20 18:54:49,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {74500#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; {74500#false} is VALID [2022-02-20 18:54:49,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {74500#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {74500#false} is VALID [2022-02-20 18:54:49,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {74500#false} assume ~send4~0 != ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {74500#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {74500#false} is VALID [2022-02-20 18:54:49,287 INFO L290 TraceCheckUtils]: 47: Hoare triple {74500#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,287 INFO L290 TraceCheckUtils]: 48: Hoare triple {74500#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {74500#false} is VALID [2022-02-20 18:54:49,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {74500#false} assume ~send5~0 != ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {74500#false} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {74500#false} is VALID [2022-02-20 18:54:49,288 INFO L290 TraceCheckUtils]: 51: Hoare triple {74500#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {74500#false} is VALID [2022-02-20 18:54:49,288 INFO L290 TraceCheckUtils]: 52: Hoare triple {74500#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {74500#false} is VALID [2022-02-20 18:54:49,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {74500#false} assume !(~r1~0 % 256 >= 5); {74500#false} is VALID [2022-02-20 18:54:49,288 INFO L290 TraceCheckUtils]: 54: Hoare triple {74500#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {74500#false} is VALID [2022-02-20 18:54:49,288 INFO L290 TraceCheckUtils]: 55: Hoare triple {74500#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6256~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6256~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; {74500#false} is VALID [2022-02-20 18:54:49,288 INFO L290 TraceCheckUtils]: 56: Hoare triple {74500#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {74500#false} assume !(0 == ~mode1~0 % 256); {74500#false} is VALID [2022-02-20 18:54:49,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {74500#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {74500#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 60: Hoare triple {74500#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {74500#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {74500#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {74500#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {74500#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {74500#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {74500#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 67: Hoare triple {74500#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 68: Hoare triple {74500#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {74500#false} is VALID [2022-02-20 18:54:49,289 INFO L290 TraceCheckUtils]: 69: Hoare triple {74500#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 70: Hoare triple {74500#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 71: Hoare triple {74500#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 72: Hoare triple {74500#false} ~mode5~0 := 0; {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 73: Hoare triple {74500#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 74: Hoare triple {74500#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 75: Hoare triple {74500#false} assume !(~r1~0 % 256 >= 5); {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 76: Hoare triple {74500#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 77: Hoare triple {74500#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {74500#false} ~__return_6448~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6448~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; {74500#false} is VALID [2022-02-20 18:54:49,290 INFO L290 TraceCheckUtils]: 79: Hoare triple {74500#false} assume 0 == main_~assert__arg~1#1 % 256; {74500#false} is VALID [2022-02-20 18:54:49,291 INFO L290 TraceCheckUtils]: 80: Hoare triple {74500#false} assume !false; {74500#false} is VALID [2022-02-20 18:54:49,291 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:54:49,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:49,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698840868] [2022-02-20 18:54:49,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698840868] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:49,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:49,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:49,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127060628] [2022-02-20 18:54:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:49,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:54:49,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:49,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:49,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:49,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:49,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:49,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:49,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:49,342 INFO L87 Difference]: Start difference. First operand 1582 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)