./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-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.7.ufo.BOUNDED-14.pals.c.v+cfa-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 2b8cc349a19a972b0be64ea80cb0d8ffd687af01d6d76bd436b271bb666f9a3a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:56:09,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:56:09,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:56:09,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:56:09,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:56:09,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:56:09,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:56:09,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:56:09,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:56:09,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:56:09,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:56:09,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:56:09,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:56:09,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:56:09,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:56:09,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:56:09,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:56:09,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:56:09,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:56:09,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:56:09,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:56:09,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:56:09,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:56:09,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:56:09,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:56:09,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:56:09,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:56:09,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:56:09,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:56:09,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:56:09,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:56:09,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:56:09,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:56:09,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:56:09,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:56:09,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:56:09,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:56:09,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:56:09,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:56:09,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:56:09,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:56:09,704 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:56:09,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:56:09,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:56:09,728 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:56:09,728 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:56:09,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:56:09,729 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:56:09,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:56:09,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:56:09,730 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:56:09,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:56:09,731 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:56:09,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:56:09,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:56:09,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:56:09,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:56:09,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:56:09,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:56:09,732 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:56:09,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:56:09,732 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:56:09,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:56:09,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:56:09,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:56:09,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:56:09,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:56:09,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:56:09,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:56:09,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:56:09,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:56:09,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:56:09,734 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:56:09,734 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:56:09,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:56:09,735 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 -> 2b8cc349a19a972b0be64ea80cb0d8ffd687af01d6d76bd436b271bb666f9a3a [2022-02-20 18:56:09,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:56:09,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:56:09,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:56:09,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:56:09,911 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:56:09,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2022-02-20 18:56:09,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a953b1d/31b10b23b9aa4b52a571b9986af304f7/FLAG9b7e54665 [2022-02-20 18:56:10,311 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:56:10,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2022-02-20 18:56:10,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a953b1d/31b10b23b9aa4b52a571b9986af304f7/FLAG9b7e54665 [2022-02-20 18:56:10,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a953b1d/31b10b23b9aa4b52a571b9986af304f7 [2022-02-20 18:56:10,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:56:10,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:56:10,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:56:10,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:56:10,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:56:10,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:56:10" (1/1) ... [2022-02-20 18:56:10,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d7f36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:10, skipping insertion in model container [2022-02-20 18:56:10,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:56:10" (1/1) ... [2022-02-20 18:56:10,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:56:10,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:56:11,001 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.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7631,7644] [2022-02-20 18:56:11,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:56:11,051 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:56:11,087 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.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7631,7644] [2022-02-20 18:56:11,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:56:11,114 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:56:11,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11 WrapperNode [2022-02-20 18:56:11,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:56:11,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:56:11,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:56:11,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:56:11,122 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:56:11" (1/1) ... [2022-02-20 18:56:11,152 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:56:11" (1/1) ... [2022-02-20 18:56:11,196 INFO L137 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 576 [2022-02-20 18:56:11,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:56:11,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:56:11,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:56:11,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:56:11,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11" (1/1) ... [2022-02-20 18:56:11,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11" (1/1) ... [2022-02-20 18:56:11,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11" (1/1) ... [2022-02-20 18:56:11,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11" (1/1) ... [2022-02-20 18:56:11,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11" (1/1) ... [2022-02-20 18:56:11,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11" (1/1) ... [2022-02-20 18:56:11,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11" (1/1) ... [2022-02-20 18:56:11,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:56:11,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:56:11,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:56:11,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:56:11,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11" (1/1) ... [2022-02-20 18:56:11,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:56:11,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:56:11,259 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:56:11,260 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:56:11,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:56:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:56:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:56:11,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:56:11,375 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:56:11,376 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:56:11,934 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:56:11,943 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:56:11,943 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:56:11,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:56:11 BoogieIcfgContainer [2022-02-20 18:56:11,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:56:11,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:56:11,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:56:11,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:56:11,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:56:10" (1/3) ... [2022-02-20 18:56:11,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2014bf86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:56:11, skipping insertion in model container [2022-02-20 18:56:11,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:11" (2/3) ... [2022-02-20 18:56:11,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2014bf86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:56:11, skipping insertion in model container [2022-02-20 18:56:11,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:56:11" (3/3) ... [2022-02-20 18:56:11,952 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2022-02-20 18:56:11,955 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:56:11,956 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:56:11,985 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:56:11,989 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:56:11,989 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:56:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 18:56:12,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:12,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:12,012 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash -313177950, now seen corresponding path program 1 times [2022-02-20 18:56:12,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:12,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308249811] [2022-02-20 18:56:12,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:12,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:12,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#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(49, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28553~0 := 0;~__return_28705~0 := 0;~__return_28809~0 := 0; {139#true} is VALID [2022-02-20 18:56:12,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {139#true} is VALID [2022-02-20 18:56:12,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume 0 == ~r1~0; {139#true} is VALID [2022-02-20 18:56:12,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {139#true} assume ~id1~0 >= 0; {139#true} is VALID [2022-02-20 18:56:12,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {139#true} assume 0 == ~st1~0; {139#true} is VALID [2022-02-20 18:56:12,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} assume ~send1~0 == ~id1~0; {139#true} is VALID [2022-02-20 18:56:12,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#true} assume 0 == ~mode1~0 % 256; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28553~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28553~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,347 INFO L290 TraceCheckUtils]: 53: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 14;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:12,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {140#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:56:12,348 INFO L290 TraceCheckUtils]: 56: Hoare triple {140#false} ~mode1~0 := 0; {140#false} is VALID [2022-02-20 18:56:12,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {140#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {140#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {140#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:56:12,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {140#false} ~mode2~0 := 0; {140#false} is VALID [2022-02-20 18:56:12,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {140#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {140#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {140#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:56:12,353 INFO L290 TraceCheckUtils]: 64: Hoare triple {140#false} ~mode3~0 := 0; {140#false} is VALID [2022-02-20 18:56:12,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {140#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,354 INFO L290 TraceCheckUtils]: 66: Hoare triple {140#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,354 INFO L290 TraceCheckUtils]: 67: Hoare triple {140#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:56:12,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {140#false} ~mode4~0 := 0; {140#false} is VALID [2022-02-20 18:56:12,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {140#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,355 INFO L290 TraceCheckUtils]: 70: Hoare triple {140#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,355 INFO L290 TraceCheckUtils]: 71: Hoare triple {140#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:56:12,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {140#false} ~mode5~0 := 0; {140#false} is VALID [2022-02-20 18:56:12,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {140#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,355 INFO L290 TraceCheckUtils]: 74: Hoare triple {140#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {140#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:56:12,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {140#false} ~mode6~0 := 0; {140#false} is VALID [2022-02-20 18:56:12,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {140#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,356 INFO L290 TraceCheckUtils]: 78: Hoare triple {140#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {140#false} is VALID [2022-02-20 18:56:12,357 INFO L290 TraceCheckUtils]: 79: Hoare triple {140#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:56:12,359 INFO L290 TraceCheckUtils]: 80: Hoare triple {140#false} ~mode7~0 := 0; {140#false} is VALID [2022-02-20 18:56:12,359 INFO L290 TraceCheckUtils]: 81: Hoare triple {140#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {140#false} is VALID [2022-02-20 18:56:12,360 INFO L290 TraceCheckUtils]: 82: Hoare triple {140#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {140#false} is VALID [2022-02-20 18:56:12,360 INFO L290 TraceCheckUtils]: 83: Hoare triple {140#false} ~__return_28705~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28705~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; {140#false} is VALID [2022-02-20 18:56:12,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {140#false} assume 0 == main_~assert__arg~0#1 % 256; {140#false} is VALID [2022-02-20 18:56:12,361 INFO L290 TraceCheckUtils]: 85: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-02-20 18:56:12,364 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:56:12,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:12,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308249811] [2022-02-20 18:56:12,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308249811] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:12,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:12,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:12,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740403428] [2022-02-20 18:56:12,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2022-02-20 18:56:12,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:12,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:12,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:12,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:12,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:12,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:12,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:12,478 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:12,794 INFO L93 Difference]: Finished difference Result 294 states and 484 transitions. [2022-02-20 18:56:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:12,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2022-02-20 18:56:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-02-20 18:56:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-02-20 18:56:12,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 484 transitions. [2022-02-20 18:56:13,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:13,166 INFO L225 Difference]: With dead ends: 294 [2022-02-20 18:56:13,166 INFO L226 Difference]: Without dead ends: 205 [2022-02-20 18:56:13,168 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:56:13,171 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 166 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:13,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 475 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-02-20 18:56:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2022-02-20 18:56:13,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:13,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 203 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:13,213 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 203 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:13,219 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 203 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:13,229 INFO L93 Difference]: Finished difference Result 205 states and 293 transitions. [2022-02-20 18:56:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 293 transitions. [2022-02-20 18:56:13,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:13,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:13,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 0 states have call successors, (0), 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 205 states. [2022-02-20 18:56:13,236 INFO L87 Difference]: Start difference. First operand has 203 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 0 states have call successors, (0), 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 205 states. [2022-02-20 18:56:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:13,242 INFO L93 Difference]: Finished difference Result 205 states and 293 transitions. [2022-02-20 18:56:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 293 transitions. [2022-02-20 18:56:13,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:13,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:13,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:13,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2022-02-20 18:56:13,260 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 86 [2022-02-20 18:56:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:13,261 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2022-02-20 18:56:13,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2022-02-20 18:56:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-20 18:56:13,264 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:13,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:13,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:56:13,265 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash 982762601, now seen corresponding path program 1 times [2022-02-20 18:56:13,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:13,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044312087] [2022-02-20 18:56:13,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:13,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {1203#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(49, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28553~0 := 0;~__return_28705~0 := 0;~__return_28809~0 := 0; {1203#true} is VALID [2022-02-20 18:56:13,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {1203#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {1203#true} is VALID [2022-02-20 18:56:13,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {1203#true} assume 0 == ~r1~0; {1203#true} is VALID [2022-02-20 18:56:13,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {1203#true} assume ~id1~0 >= 0; {1203#true} is VALID [2022-02-20 18:56:13,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {1203#true} assume 0 == ~st1~0; {1203#true} is VALID [2022-02-20 18:56:13,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {1203#true} assume ~send1~0 == ~id1~0; {1203#true} is VALID [2022-02-20 18:56:13,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {1203#true} assume 0 == ~mode1~0 % 256; {1203#true} is VALID [2022-02-20 18:56:13,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {1203#true} assume ~id2~0 >= 0; {1203#true} is VALID [2022-02-20 18:56:13,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#true} assume 0 == ~st2~0; {1203#true} is VALID [2022-02-20 18:56:13,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {1203#true} assume ~send2~0 == ~id2~0; {1203#true} is VALID [2022-02-20 18:56:13,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {1203#true} assume 0 == ~mode2~0 % 256; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,415 INFO L290 TraceCheckUtils]: 45: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,415 INFO L290 TraceCheckUtils]: 46: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,416 INFO L290 TraceCheckUtils]: 47: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,416 INFO L290 TraceCheckUtils]: 48: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,416 INFO L290 TraceCheckUtils]: 49: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28553~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28553~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 14;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,419 INFO L290 TraceCheckUtils]: 55: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:13,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {1204#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:56:13,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {1204#false} ~mode2~0 := 0; {1204#false} is VALID [2022-02-20 18:56:13,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {1204#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {1204#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {1204#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:56:13,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {1204#false} ~mode3~0 := 0; {1204#false} is VALID [2022-02-20 18:56:13,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {1204#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {1204#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {1204#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:56:13,423 INFO L290 TraceCheckUtils]: 69: Hoare triple {1204#false} ~mode4~0 := 0; {1204#false} is VALID [2022-02-20 18:56:13,423 INFO L290 TraceCheckUtils]: 70: Hoare triple {1204#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,423 INFO L290 TraceCheckUtils]: 71: Hoare triple {1204#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,423 INFO L290 TraceCheckUtils]: 72: Hoare triple {1204#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:56:13,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {1204#false} ~mode5~0 := 0; {1204#false} is VALID [2022-02-20 18:56:13,424 INFO L290 TraceCheckUtils]: 74: Hoare triple {1204#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {1204#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,424 INFO L290 TraceCheckUtils]: 76: Hoare triple {1204#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:56:13,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {1204#false} ~mode6~0 := 0; {1204#false} is VALID [2022-02-20 18:56:13,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {1204#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {1204#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1204#false} is VALID [2022-02-20 18:56:13,425 INFO L290 TraceCheckUtils]: 80: Hoare triple {1204#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:56:13,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {1204#false} ~mode7~0 := 0; {1204#false} is VALID [2022-02-20 18:56:13,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {1204#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1204#false} is VALID [2022-02-20 18:56:13,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {1204#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {1204#false} is VALID [2022-02-20 18:56:13,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {1204#false} ~__return_28705~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28705~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; {1204#false} is VALID [2022-02-20 18:56:13,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {1204#false} assume 0 == main_~assert__arg~0#1 % 256; {1204#false} is VALID [2022-02-20 18:56:13,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {1204#false} assume !false; {1204#false} is VALID [2022-02-20 18:56:13,426 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:56:13,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:13,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044312087] [2022-02-20 18:56:13,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044312087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:13,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:13,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:13,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529366543] [2022-02-20 18:56:13,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:13,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 18:56:13,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:13,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:13,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:13,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:13,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:13,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:13,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:13,486 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:13,756 INFO L93 Difference]: Finished difference Result 487 states and 744 transitions. [2022-02-20 18:56:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 18:56:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:13,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:56:14,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:14,031 INFO L225 Difference]: With dead ends: 487 [2022-02-20 18:56:14,031 INFO L226 Difference]: Without dead ends: 337 [2022-02-20 18:56:14,032 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:56:14,033 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 112 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:14,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 408 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-02-20 18:56:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-02-20 18:56:14,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:14,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,051 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,051 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:14,060 INFO L93 Difference]: Finished difference Result 337 states and 503 transitions. [2022-02-20 18:56:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 503 transitions. [2022-02-20 18:56:14,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:14,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:14,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 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 337 states. [2022-02-20 18:56:14,062 INFO L87 Difference]: Start difference. First operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 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 337 states. [2022-02-20 18:56:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:14,070 INFO L93 Difference]: Finished difference Result 337 states and 503 transitions. [2022-02-20 18:56:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 503 transitions. [2022-02-20 18:56:14,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:14,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:14,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:14,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 502 transitions. [2022-02-20 18:56:14,081 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 502 transitions. Word has length 87 [2022-02-20 18:56:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:14,081 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 502 transitions. [2022-02-20 18:56:14,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 502 transitions. [2022-02-20 18:56:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 18:56:14,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:14,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:14,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:56:14,083 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:14,084 INFO L85 PathProgramCache]: Analyzing trace with hash 914543768, now seen corresponding path program 1 times [2022-02-20 18:56:14,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:14,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916659933] [2022-02-20 18:56:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:14,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {2987#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(49, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28553~0 := 0;~__return_28705~0 := 0;~__return_28809~0 := 0; {2987#true} is VALID [2022-02-20 18:56:14,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {2987#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {2987#true} is VALID [2022-02-20 18:56:14,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {2987#true} assume 0 == ~r1~0; {2987#true} is VALID [2022-02-20 18:56:14,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {2987#true} assume ~id1~0 >= 0; {2987#true} is VALID [2022-02-20 18:56:14,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {2987#true} assume 0 == ~st1~0; {2987#true} is VALID [2022-02-20 18:56:14,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {2987#true} assume ~send1~0 == ~id1~0; {2987#true} is VALID [2022-02-20 18:56:14,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {2987#true} assume 0 == ~mode1~0 % 256; {2987#true} is VALID [2022-02-20 18:56:14,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {2987#true} assume ~id2~0 >= 0; {2987#true} is VALID [2022-02-20 18:56:14,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {2987#true} assume 0 == ~st2~0; {2987#true} is VALID [2022-02-20 18:56:14,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {2987#true} assume ~send2~0 == ~id2~0; {2987#true} is VALID [2022-02-20 18:56:14,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {2987#true} assume 0 == ~mode2~0 % 256; {2987#true} is VALID [2022-02-20 18:56:14,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {2987#true} assume ~id3~0 >= 0; {2987#true} is VALID [2022-02-20 18:56:14,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {2987#true} assume 0 == ~st3~0; {2987#true} is VALID [2022-02-20 18:56:14,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {2987#true} assume ~send3~0 == ~id3~0; {2987#true} is VALID [2022-02-20 18:56:14,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {2987#true} assume 0 == ~mode3~0 % 256; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28553~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28553~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 14;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,189 INFO L290 TraceCheckUtils]: 55: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,191 INFO L290 TraceCheckUtils]: 59: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,192 INFO L290 TraceCheckUtils]: 61: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,192 INFO L290 TraceCheckUtils]: 62: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,193 INFO L290 TraceCheckUtils]: 63: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:14,193 INFO L290 TraceCheckUtils]: 64: Hoare triple {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2988#false} is VALID [2022-02-20 18:56:14,193 INFO L290 TraceCheckUtils]: 65: Hoare triple {2988#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:56:14,194 INFO L290 TraceCheckUtils]: 66: Hoare triple {2988#false} ~mode3~0 := 0; {2988#false} is VALID [2022-02-20 18:56:14,194 INFO L290 TraceCheckUtils]: 67: Hoare triple {2988#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2988#false} is VALID [2022-02-20 18:56:14,194 INFO L290 TraceCheckUtils]: 68: Hoare triple {2988#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2988#false} is VALID [2022-02-20 18:56:14,194 INFO L290 TraceCheckUtils]: 69: Hoare triple {2988#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:56:14,194 INFO L290 TraceCheckUtils]: 70: Hoare triple {2988#false} ~mode4~0 := 0; {2988#false} is VALID [2022-02-20 18:56:14,195 INFO L290 TraceCheckUtils]: 71: Hoare triple {2988#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {2988#false} is VALID [2022-02-20 18:56:14,195 INFO L290 TraceCheckUtils]: 72: Hoare triple {2988#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2988#false} is VALID [2022-02-20 18:56:14,195 INFO L290 TraceCheckUtils]: 73: Hoare triple {2988#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:56:14,195 INFO L290 TraceCheckUtils]: 74: Hoare triple {2988#false} ~mode5~0 := 0; {2988#false} is VALID [2022-02-20 18:56:14,195 INFO L290 TraceCheckUtils]: 75: Hoare triple {2988#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {2988#false} is VALID [2022-02-20 18:56:14,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {2988#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2988#false} is VALID [2022-02-20 18:56:14,196 INFO L290 TraceCheckUtils]: 77: Hoare triple {2988#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:56:14,196 INFO L290 TraceCheckUtils]: 78: Hoare triple {2988#false} ~mode6~0 := 0; {2988#false} is VALID [2022-02-20 18:56:14,196 INFO L290 TraceCheckUtils]: 79: Hoare triple {2988#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {2988#false} is VALID [2022-02-20 18:56:14,196 INFO L290 TraceCheckUtils]: 80: Hoare triple {2988#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2988#false} is VALID [2022-02-20 18:56:14,197 INFO L290 TraceCheckUtils]: 81: Hoare triple {2988#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:56:14,197 INFO L290 TraceCheckUtils]: 82: Hoare triple {2988#false} ~mode7~0 := 0; {2988#false} is VALID [2022-02-20 18:56:14,197 INFO L290 TraceCheckUtils]: 83: Hoare triple {2988#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2988#false} is VALID [2022-02-20 18:56:14,197 INFO L290 TraceCheckUtils]: 84: Hoare triple {2988#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {2988#false} is VALID [2022-02-20 18:56:14,197 INFO L290 TraceCheckUtils]: 85: Hoare triple {2988#false} ~__return_28705~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28705~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; {2988#false} is VALID [2022-02-20 18:56:14,204 INFO L290 TraceCheckUtils]: 86: Hoare triple {2988#false} assume 0 == main_~assert__arg~0#1 % 256; {2988#false} is VALID [2022-02-20 18:56:14,204 INFO L290 TraceCheckUtils]: 87: Hoare triple {2988#false} assume !false; {2988#false} is VALID [2022-02-20 18:56:14,204 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:56:14,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:14,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916659933] [2022-02-20 18:56:14,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916659933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:14,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:14,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:14,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778944064] [2022-02-20 18:56:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:14,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2022-02-20 18:56:14,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:14,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:14,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:14,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:14,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:14,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:14,262 INFO L87 Difference]: Start difference. First operand 335 states and 502 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:14,498 INFO L93 Difference]: Finished difference Result 867 states and 1348 transitions. [2022-02-20 18:56:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2022-02-20 18:56:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:14,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:56:14,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:14,761 INFO L225 Difference]: With dead ends: 867 [2022-02-20 18:56:14,761 INFO L226 Difference]: Without dead ends: 585 [2022-02-20 18:56:14,762 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:56:14,763 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 107 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:14,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 404 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-02-20 18:56:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 583. [2022-02-20 18:56:14,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:14,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 585 states. Second operand has 583 states, 582 states have (on average 1.5360824742268042) internal successors, (894), 582 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,789 INFO L74 IsIncluded]: Start isIncluded. First operand 585 states. Second operand has 583 states, 582 states have (on average 1.5360824742268042) internal successors, (894), 582 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,790 INFO L87 Difference]: Start difference. First operand 585 states. Second operand has 583 states, 582 states have (on average 1.5360824742268042) internal successors, (894), 582 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:14,804 INFO L93 Difference]: Finished difference Result 585 states and 895 transitions. [2022-02-20 18:56:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 895 transitions. [2022-02-20 18:56:14,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:14,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:14,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 583 states, 582 states have (on average 1.5360824742268042) internal successors, (894), 582 states have internal predecessors, (894), 0 states have call successors, (0), 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 585 states. [2022-02-20 18:56:14,807 INFO L87 Difference]: Start difference. First operand has 583 states, 582 states have (on average 1.5360824742268042) internal successors, (894), 582 states have internal predecessors, (894), 0 states have call successors, (0), 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 585 states. [2022-02-20 18:56:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:14,820 INFO L93 Difference]: Finished difference Result 585 states and 895 transitions. [2022-02-20 18:56:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 895 transitions. [2022-02-20 18:56:14,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:14,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:14,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:14,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.5360824742268042) internal successors, (894), 582 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 894 transitions. [2022-02-20 18:56:14,860 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 894 transitions. Word has length 88 [2022-02-20 18:56:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:14,861 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 894 transitions. [2022-02-20 18:56:14,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 894 transitions. [2022-02-20 18:56:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-20 18:56:14,862 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:14,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:14,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:56:14,862 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash 349801040, now seen corresponding path program 1 times [2022-02-20 18:56:14,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:14,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284585333] [2022-02-20 18:56:14,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:14,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {6148#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(49, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28553~0 := 0;~__return_28705~0 := 0;~__return_28809~0 := 0; {6148#true} is VALID [2022-02-20 18:56:14,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {6148#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {6148#true} is VALID [2022-02-20 18:56:14,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {6148#true} assume 0 == ~r1~0; {6148#true} is VALID [2022-02-20 18:56:14,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {6148#true} assume ~id1~0 >= 0; {6148#true} is VALID [2022-02-20 18:56:14,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {6148#true} assume 0 == ~st1~0; {6148#true} is VALID [2022-02-20 18:56:14,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {6148#true} assume ~send1~0 == ~id1~0; {6148#true} is VALID [2022-02-20 18:56:14,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {6148#true} assume 0 == ~mode1~0 % 256; {6148#true} is VALID [2022-02-20 18:56:14,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {6148#true} assume ~id2~0 >= 0; {6148#true} is VALID [2022-02-20 18:56:14,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {6148#true} assume 0 == ~st2~0; {6148#true} is VALID [2022-02-20 18:56:14,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {6148#true} assume ~send2~0 == ~id2~0; {6148#true} is VALID [2022-02-20 18:56:14,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {6148#true} assume 0 == ~mode2~0 % 256; {6148#true} is VALID [2022-02-20 18:56:14,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {6148#true} assume ~id3~0 >= 0; {6148#true} is VALID [2022-02-20 18:56:14,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {6148#true} assume 0 == ~st3~0; {6148#true} is VALID [2022-02-20 18:56:14,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {6148#true} assume ~send3~0 == ~id3~0; {6148#true} is VALID [2022-02-20 18:56:14,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {6148#true} assume 0 == ~mode3~0 % 256; {6148#true} is VALID [2022-02-20 18:56:14,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {6148#true} assume ~id4~0 >= 0; {6148#true} is VALID [2022-02-20 18:56:14,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {6148#true} assume 0 == ~st4~0; {6148#true} is VALID [2022-02-20 18:56:14,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {6148#true} assume ~send4~0 == ~id4~0; {6148#true} is VALID [2022-02-20 18:56:14,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {6148#true} assume 0 == ~mode4~0 % 256; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28553~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28553~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume main_~main__i2~0#1 < 14;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,940 INFO L290 TraceCheckUtils]: 59: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,941 INFO L290 TraceCheckUtils]: 60: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0); {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,941 INFO L290 TraceCheckUtils]: 61: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,941 INFO L290 TraceCheckUtils]: 62: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,942 INFO L290 TraceCheckUtils]: 64: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,943 INFO L290 TraceCheckUtils]: 67: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:14,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6149#false} is VALID [2022-02-20 18:56:14,944 INFO L290 TraceCheckUtils]: 70: Hoare triple {6149#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {6149#false} is VALID [2022-02-20 18:56:14,944 INFO L290 TraceCheckUtils]: 71: Hoare triple {6149#false} ~mode4~0 := 0; {6149#false} is VALID [2022-02-20 18:56:14,945 INFO L290 TraceCheckUtils]: 72: Hoare triple {6149#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {6149#false} is VALID [2022-02-20 18:56:14,945 INFO L290 TraceCheckUtils]: 73: Hoare triple {6149#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6149#false} is VALID [2022-02-20 18:56:14,945 INFO L290 TraceCheckUtils]: 74: Hoare triple {6149#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {6149#false} is VALID [2022-02-20 18:56:14,945 INFO L290 TraceCheckUtils]: 75: Hoare triple {6149#false} ~mode5~0 := 0; {6149#false} is VALID [2022-02-20 18:56:14,945 INFO L290 TraceCheckUtils]: 76: Hoare triple {6149#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {6149#false} is VALID [2022-02-20 18:56:14,945 INFO L290 TraceCheckUtils]: 77: Hoare triple {6149#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {6149#false} is VALID [2022-02-20 18:56:14,946 INFO L290 TraceCheckUtils]: 78: Hoare triple {6149#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {6149#false} is VALID [2022-02-20 18:56:14,946 INFO L290 TraceCheckUtils]: 79: Hoare triple {6149#false} ~mode6~0 := 0; {6149#false} is VALID [2022-02-20 18:56:14,946 INFO L290 TraceCheckUtils]: 80: Hoare triple {6149#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {6149#false} is VALID [2022-02-20 18:56:14,946 INFO L290 TraceCheckUtils]: 81: Hoare triple {6149#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {6149#false} is VALID [2022-02-20 18:56:14,946 INFO L290 TraceCheckUtils]: 82: Hoare triple {6149#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {6149#false} is VALID [2022-02-20 18:56:14,946 INFO L290 TraceCheckUtils]: 83: Hoare triple {6149#false} ~mode7~0 := 0; {6149#false} is VALID [2022-02-20 18:56:14,946 INFO L290 TraceCheckUtils]: 84: Hoare triple {6149#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6149#false} is VALID [2022-02-20 18:56:14,947 INFO L290 TraceCheckUtils]: 85: Hoare triple {6149#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {6149#false} is VALID [2022-02-20 18:56:14,947 INFO L290 TraceCheckUtils]: 86: Hoare triple {6149#false} ~__return_28705~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28705~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; {6149#false} is VALID [2022-02-20 18:56:14,947 INFO L290 TraceCheckUtils]: 87: Hoare triple {6149#false} assume 0 == main_~assert__arg~0#1 % 256; {6149#false} is VALID [2022-02-20 18:56:14,947 INFO L290 TraceCheckUtils]: 88: Hoare triple {6149#false} assume !false; {6149#false} is VALID [2022-02-20 18:56:14,947 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:56:14,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:14,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284585333] [2022-02-20 18:56:14,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284585333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:14,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:14,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:14,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650975028] [2022-02-20 18:56:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:14,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2022-02-20 18:56:14,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:14,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:14,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:14,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:14,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:14,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:14,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:14,999 INFO L87 Difference]: Start difference. First operand 583 states and 894 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:15,375 INFO L93 Difference]: Finished difference Result 1579 states and 2472 transitions. [2022-02-20 18:56:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:15,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2022-02-20 18:56:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:15,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:56:15,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:15,664 INFO L225 Difference]: With dead ends: 1579 [2022-02-20 18:56:15,664 INFO L226 Difference]: Without dead ends: 1049 [2022-02-20 18:56:15,665 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:56:15,666 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 102 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:15,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 400 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-02-20 18:56:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1047. [2022-02-20 18:56:15,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:15,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1049 states. Second operand has 1047 states, 1046 states have (on average 1.5506692160611855) internal successors, (1622), 1046 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:15,706 INFO L74 IsIncluded]: Start isIncluded. First operand 1049 states. Second operand has 1047 states, 1046 states have (on average 1.5506692160611855) internal successors, (1622), 1046 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:15,707 INFO L87 Difference]: Start difference. First operand 1049 states. Second operand has 1047 states, 1046 states have (on average 1.5506692160611855) internal successors, (1622), 1046 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:15,744 INFO L93 Difference]: Finished difference Result 1049 states and 1623 transitions. [2022-02-20 18:56:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1623 transitions. [2022-02-20 18:56:15,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:15,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:15,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 1047 states, 1046 states have (on average 1.5506692160611855) internal successors, (1622), 1046 states have internal predecessors, (1622), 0 states have call successors, (0), 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 1049 states. [2022-02-20 18:56:15,749 INFO L87 Difference]: Start difference. First operand has 1047 states, 1046 states have (on average 1.5506692160611855) internal successors, (1622), 1046 states have internal predecessors, (1622), 0 states have call successors, (0), 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 1049 states. [2022-02-20 18:56:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:15,787 INFO L93 Difference]: Finished difference Result 1049 states and 1623 transitions. [2022-02-20 18:56:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1623 transitions. [2022-02-20 18:56:15,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:15,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:15,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:15,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.5506692160611855) internal successors, (1622), 1046 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1622 transitions. [2022-02-20 18:56:15,856 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1622 transitions. Word has length 89 [2022-02-20 18:56:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:15,856 INFO L470 AbstractCegarLoop]: Abstraction has 1047 states and 1622 transitions. [2022-02-20 18:56:15,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1622 transitions. [2022-02-20 18:56:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 18:56:15,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:15,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:15,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:56:15,858 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -248220501, now seen corresponding path program 1 times [2022-02-20 18:56:15,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:15,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803201203] [2022-02-20 18:56:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:15,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:15,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {11889#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(49, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28553~0 := 0;~__return_28705~0 := 0;~__return_28809~0 := 0; {11889#true} is VALID [2022-02-20 18:56:15,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {11889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {11889#true} is VALID [2022-02-20 18:56:15,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {11889#true} assume 0 == ~r1~0; {11889#true} is VALID [2022-02-20 18:56:15,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {11889#true} assume ~id1~0 >= 0; {11889#true} is VALID [2022-02-20 18:56:15,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {11889#true} assume 0 == ~st1~0; {11889#true} is VALID [2022-02-20 18:56:15,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {11889#true} assume ~send1~0 == ~id1~0; {11889#true} is VALID [2022-02-20 18:56:15,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {11889#true} assume 0 == ~mode1~0 % 256; {11889#true} is VALID [2022-02-20 18:56:15,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {11889#true} assume ~id2~0 >= 0; {11889#true} is VALID [2022-02-20 18:56:15,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {11889#true} assume 0 == ~st2~0; {11889#true} is VALID [2022-02-20 18:56:15,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {11889#true} assume ~send2~0 == ~id2~0; {11889#true} is VALID [2022-02-20 18:56:15,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {11889#true} assume 0 == ~mode2~0 % 256; {11889#true} is VALID [2022-02-20 18:56:15,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {11889#true} assume ~id3~0 >= 0; {11889#true} is VALID [2022-02-20 18:56:15,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {11889#true} assume 0 == ~st3~0; {11889#true} is VALID [2022-02-20 18:56:15,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {11889#true} assume ~send3~0 == ~id3~0; {11889#true} is VALID [2022-02-20 18:56:15,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {11889#true} assume 0 == ~mode3~0 % 256; {11889#true} is VALID [2022-02-20 18:56:15,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {11889#true} assume ~id4~0 >= 0; {11889#true} is VALID [2022-02-20 18:56:15,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {11889#true} assume 0 == ~st4~0; {11889#true} is VALID [2022-02-20 18:56:15,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {11889#true} assume ~send4~0 == ~id4~0; {11889#true} is VALID [2022-02-20 18:56:15,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {11889#true} assume 0 == ~mode4~0 % 256; {11889#true} is VALID [2022-02-20 18:56:15,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {11889#true} assume ~id5~0 >= 0; {11889#true} is VALID [2022-02-20 18:56:15,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {11889#true} assume 0 == ~st5~0; {11889#true} is VALID [2022-02-20 18:56:15,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {11889#true} assume ~send5~0 == ~id5~0; {11889#true} is VALID [2022-02-20 18:56:15,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {11889#true} assume 0 == ~mode5~0 % 256; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,972 INFO L290 TraceCheckUtils]: 44: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,972 INFO L290 TraceCheckUtils]: 45: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,973 INFO L290 TraceCheckUtils]: 46: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,973 INFO L290 TraceCheckUtils]: 47: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,974 INFO L290 TraceCheckUtils]: 48: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,974 INFO L290 TraceCheckUtils]: 49: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,974 INFO L290 TraceCheckUtils]: 50: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28553~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28553~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume main_~main__i2~0#1 < 14;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,977 INFO L290 TraceCheckUtils]: 57: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0); {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0); {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,981 INFO L290 TraceCheckUtils]: 67: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,981 INFO L290 TraceCheckUtils]: 68: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,981 INFO L290 TraceCheckUtils]: 69: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,982 INFO L290 TraceCheckUtils]: 70: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0); {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,982 INFO L290 TraceCheckUtils]: 71: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,983 INFO L290 TraceCheckUtils]: 72: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,983 INFO L290 TraceCheckUtils]: 73: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:15,983 INFO L290 TraceCheckUtils]: 74: Hoare triple {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {11890#false} is VALID [2022-02-20 18:56:15,984 INFO L290 TraceCheckUtils]: 75: Hoare triple {11890#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {11890#false} is VALID [2022-02-20 18:56:15,984 INFO L290 TraceCheckUtils]: 76: Hoare triple {11890#false} ~mode5~0 := 0; {11890#false} is VALID [2022-02-20 18:56:15,984 INFO L290 TraceCheckUtils]: 77: Hoare triple {11890#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {11890#false} is VALID [2022-02-20 18:56:15,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {11890#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {11890#false} is VALID [2022-02-20 18:56:15,984 INFO L290 TraceCheckUtils]: 79: Hoare triple {11890#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {11890#false} is VALID [2022-02-20 18:56:15,984 INFO L290 TraceCheckUtils]: 80: Hoare triple {11890#false} ~mode6~0 := 0; {11890#false} is VALID [2022-02-20 18:56:15,984 INFO L290 TraceCheckUtils]: 81: Hoare triple {11890#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {11890#false} is VALID [2022-02-20 18:56:15,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {11890#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {11890#false} is VALID [2022-02-20 18:56:15,985 INFO L290 TraceCheckUtils]: 83: Hoare triple {11890#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {11890#false} is VALID [2022-02-20 18:56:15,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {11890#false} ~mode7~0 := 0; {11890#false} is VALID [2022-02-20 18:56:15,985 INFO L290 TraceCheckUtils]: 85: Hoare triple {11890#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {11890#false} is VALID [2022-02-20 18:56:15,985 INFO L290 TraceCheckUtils]: 86: Hoare triple {11890#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {11890#false} is VALID [2022-02-20 18:56:15,985 INFO L290 TraceCheckUtils]: 87: Hoare triple {11890#false} ~__return_28705~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28705~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; {11890#false} is VALID [2022-02-20 18:56:15,985 INFO L290 TraceCheckUtils]: 88: Hoare triple {11890#false} assume 0 == main_~assert__arg~0#1 % 256; {11890#false} is VALID [2022-02-20 18:56:15,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {11890#false} assume !false; {11890#false} is VALID [2022-02-20 18:56:15,986 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:56:15,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:15,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803201203] [2022-02-20 18:56:15,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803201203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:15,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:15,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:15,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990826763] [2022-02-20 18:56:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:15,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:56:15,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:15,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:16,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:16,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:16,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:16,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:16,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:16,043 INFO L87 Difference]: Start difference. First operand 1047 states and 1622 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:16,710 INFO L93 Difference]: Finished difference Result 2907 states and 4552 transitions. [2022-02-20 18:56:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:16,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:56:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:16,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:56:16,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:17,180 INFO L225 Difference]: With dead ends: 2907 [2022-02-20 18:56:17,180 INFO L226 Difference]: Without dead ends: 1913 [2022-02-20 18:56:17,181 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:56:17,182 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 97 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:17,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 396 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-02-20 18:56:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1911. [2022-02-20 18:56:17,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:17,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1913 states. Second operand has 1911 states, 1910 states have (on average 1.5528795811518326) internal successors, (2966), 1910 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:17,253 INFO L74 IsIncluded]: Start isIncluded. First operand 1913 states. Second operand has 1911 states, 1910 states have (on average 1.5528795811518326) internal successors, (2966), 1910 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:17,256 INFO L87 Difference]: Start difference. First operand 1913 states. Second operand has 1911 states, 1910 states have (on average 1.5528795811518326) internal successors, (2966), 1910 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:17,361 INFO L93 Difference]: Finished difference Result 1913 states and 2967 transitions. [2022-02-20 18:56:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2967 transitions. [2022-02-20 18:56:17,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:17,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:17,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 1911 states, 1910 states have (on average 1.5528795811518326) internal successors, (2966), 1910 states have internal predecessors, (2966), 0 states have call successors, (0), 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 1913 states. [2022-02-20 18:56:17,369 INFO L87 Difference]: Start difference. First operand has 1911 states, 1910 states have (on average 1.5528795811518326) internal successors, (2966), 1910 states have internal predecessors, (2966), 0 states have call successors, (0), 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 1913 states. [2022-02-20 18:56:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:17,472 INFO L93 Difference]: Finished difference Result 1913 states and 2967 transitions. [2022-02-20 18:56:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2967 transitions. [2022-02-20 18:56:17,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:17,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:17,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:17,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1910 states have (on average 1.5528795811518326) internal successors, (2966), 1910 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2966 transitions. [2022-02-20 18:56:17,623 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2966 transitions. Word has length 90 [2022-02-20 18:56:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:17,623 INFO L470 AbstractCegarLoop]: Abstraction has 1911 states and 2966 transitions. [2022-02-20 18:56:17,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2966 transitions. [2022-02-20 18:56:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 18:56:17,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:17,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:17,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:56:17,625 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1910770737, now seen corresponding path program 1 times [2022-02-20 18:56:17,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:17,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693192140] [2022-02-20 18:56:17,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:17,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {22442#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(49, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28553~0 := 0;~__return_28705~0 := 0;~__return_28809~0 := 0; {22442#true} is VALID [2022-02-20 18:56:17,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {22442#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {22442#true} is VALID [2022-02-20 18:56:17,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {22442#true} assume 0 == ~r1~0; {22442#true} is VALID [2022-02-20 18:56:17,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {22442#true} assume ~id1~0 >= 0; {22442#true} is VALID [2022-02-20 18:56:17,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {22442#true} assume 0 == ~st1~0; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {22442#true} assume ~send1~0 == ~id1~0; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {22442#true} assume 0 == ~mode1~0 % 256; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {22442#true} assume ~id2~0 >= 0; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {22442#true} assume 0 == ~st2~0; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {22442#true} assume ~send2~0 == ~id2~0; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {22442#true} assume 0 == ~mode2~0 % 256; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {22442#true} assume ~id3~0 >= 0; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {22442#true} assume 0 == ~st3~0; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {22442#true} assume ~send3~0 == ~id3~0; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {22442#true} assume 0 == ~mode3~0 % 256; {22442#true} is VALID [2022-02-20 18:56:17,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {22442#true} assume ~id4~0 >= 0; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {22442#true} assume 0 == ~st4~0; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {22442#true} assume ~send4~0 == ~id4~0; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {22442#true} assume 0 == ~mode4~0 % 256; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {22442#true} assume ~id5~0 >= 0; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {22442#true} assume 0 == ~st5~0; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {22442#true} assume ~send5~0 == ~id5~0; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {22442#true} assume 0 == ~mode5~0 % 256; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {22442#true} assume ~id6~0 >= 0; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {22442#true} assume 0 == ~st6~0; {22442#true} is VALID [2022-02-20 18:56:17,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {22442#true} assume ~send6~0 == ~id6~0; {22442#true} is VALID [2022-02-20 18:56:17,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {22442#true} assume 0 == ~mode6~0 % 256; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28553~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28553~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume main_~main__i2~0#1 < 14;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,722 INFO L290 TraceCheckUtils]: 54: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,726 INFO L290 TraceCheckUtils]: 60: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~nomsg~0); {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,726 INFO L290 TraceCheckUtils]: 61: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,727 INFO L290 TraceCheckUtils]: 63: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~nomsg~0); {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,728 INFO L290 TraceCheckUtils]: 66: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,729 INFO L290 TraceCheckUtils]: 67: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,736 INFO L290 TraceCheckUtils]: 68: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~nomsg~0); {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,738 INFO L290 TraceCheckUtils]: 71: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,739 INFO L290 TraceCheckUtils]: 72: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,740 INFO L290 TraceCheckUtils]: 74: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,740 INFO L290 TraceCheckUtils]: 75: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~nomsg~0); {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,741 INFO L290 TraceCheckUtils]: 76: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,742 INFO L290 TraceCheckUtils]: 78: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:17,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {22443#false} is VALID [2022-02-20 18:56:17,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {22443#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {22443#false} is VALID [2022-02-20 18:56:17,743 INFO L290 TraceCheckUtils]: 81: Hoare triple {22443#false} ~mode6~0 := 0; {22443#false} is VALID [2022-02-20 18:56:17,743 INFO L290 TraceCheckUtils]: 82: Hoare triple {22443#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {22443#false} is VALID [2022-02-20 18:56:17,743 INFO L290 TraceCheckUtils]: 83: Hoare triple {22443#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {22443#false} is VALID [2022-02-20 18:56:17,743 INFO L290 TraceCheckUtils]: 84: Hoare triple {22443#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {22443#false} is VALID [2022-02-20 18:56:17,743 INFO L290 TraceCheckUtils]: 85: Hoare triple {22443#false} ~mode7~0 := 0; {22443#false} is VALID [2022-02-20 18:56:17,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {22443#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {22443#false} is VALID [2022-02-20 18:56:17,743 INFO L290 TraceCheckUtils]: 87: Hoare triple {22443#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {22443#false} is VALID [2022-02-20 18:56:17,744 INFO L290 TraceCheckUtils]: 88: Hoare triple {22443#false} ~__return_28705~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28705~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; {22443#false} is VALID [2022-02-20 18:56:17,746 INFO L290 TraceCheckUtils]: 89: Hoare triple {22443#false} assume 0 == main_~assert__arg~0#1 % 256; {22443#false} is VALID [2022-02-20 18:56:17,746 INFO L290 TraceCheckUtils]: 90: Hoare triple {22443#false} assume !false; {22443#false} is VALID [2022-02-20 18:56:17,747 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:56:17,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:17,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693192140] [2022-02-20 18:56:17,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693192140] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:17,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:17,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:17,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878144523] [2022-02-20 18:56:17,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:17,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 18:56:17,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:17,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:17,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:17,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:17,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:17,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:17,811 INFO L87 Difference]: Start difference. First operand 1911 states and 2966 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:19,308 INFO L93 Difference]: Finished difference Result 5371 states and 8376 transitions. [2022-02-20 18:56:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:19,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 18:56:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:19,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:56:19,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:20,033 INFO L225 Difference]: With dead ends: 5371 [2022-02-20 18:56:20,034 INFO L226 Difference]: Without dead ends: 3513 [2022-02-20 18:56:20,036 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:56:20,036 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 92 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:20,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 392 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2022-02-20 18:56:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3511. [2022-02-20 18:56:20,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:20,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3513 states. Second operand has 3511 states, 3510 states have (on average 1.547008547008547) internal successors, (5430), 3510 states have internal predecessors, (5430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:20,168 INFO L74 IsIncluded]: Start isIncluded. First operand 3513 states. Second operand has 3511 states, 3510 states have (on average 1.547008547008547) internal successors, (5430), 3510 states have internal predecessors, (5430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:20,173 INFO L87 Difference]: Start difference. First operand 3513 states. Second operand has 3511 states, 3510 states have (on average 1.547008547008547) internal successors, (5430), 3510 states have internal predecessors, (5430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:20,584 INFO L93 Difference]: Finished difference Result 3513 states and 5431 transitions. [2022-02-20 18:56:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5431 transitions. [2022-02-20 18:56:20,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:20,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:20,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 3511 states, 3510 states have (on average 1.547008547008547) internal successors, (5430), 3510 states have internal predecessors, (5430), 0 states have call successors, (0), 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 3513 states. [2022-02-20 18:56:20,598 INFO L87 Difference]: Start difference. First operand has 3511 states, 3510 states have (on average 1.547008547008547) internal successors, (5430), 3510 states have internal predecessors, (5430), 0 states have call successors, (0), 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 3513 states. [2022-02-20 18:56:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:20,988 INFO L93 Difference]: Finished difference Result 3513 states and 5431 transitions. [2022-02-20 18:56:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5431 transitions. [2022-02-20 18:56:20,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:20,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:20,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:20,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3510 states have (on average 1.547008547008547) internal successors, (5430), 3510 states have internal predecessors, (5430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5430 transitions. [2022-02-20 18:56:21,588 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5430 transitions. Word has length 91 [2022-02-20 18:56:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:21,589 INFO L470 AbstractCegarLoop]: Abstraction has 3511 states and 5430 transitions. [2022-02-20 18:56:21,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5430 transitions. [2022-02-20 18:56:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:56:21,589 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:21,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:21,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:56:21,590 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash 307326139, now seen corresponding path program 1 times [2022-02-20 18:56:21,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:21,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389158720] [2022-02-20 18:56:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:21,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {41923#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(49, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28553~0 := 0;~__return_28705~0 := 0;~__return_28809~0 := 0; {41923#true} is VALID [2022-02-20 18:56:21,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {41923#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {41923#true} is VALID [2022-02-20 18:56:21,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {41923#true} assume 0 == ~r1~0; {41923#true} is VALID [2022-02-20 18:56:21,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {41923#true} assume ~id1~0 >= 0; {41923#true} is VALID [2022-02-20 18:56:21,649 INFO L290 TraceCheckUtils]: 4: Hoare triple {41923#true} assume 0 == ~st1~0; {41923#true} is VALID [2022-02-20 18:56:21,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {41923#true} assume ~send1~0 == ~id1~0; {41923#true} is VALID [2022-02-20 18:56:21,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {41923#true} assume 0 == ~mode1~0 % 256; {41923#true} is VALID [2022-02-20 18:56:21,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {41923#true} assume ~id2~0 >= 0; {41923#true} is VALID [2022-02-20 18:56:21,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {41923#true} assume 0 == ~st2~0; {41923#true} is VALID [2022-02-20 18:56:21,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {41923#true} assume ~send2~0 == ~id2~0; {41923#true} is VALID [2022-02-20 18:56:21,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {41923#true} assume 0 == ~mode2~0 % 256; {41923#true} is VALID [2022-02-20 18:56:21,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {41923#true} assume ~id3~0 >= 0; {41923#true} is VALID [2022-02-20 18:56:21,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {41923#true} assume 0 == ~st3~0; {41923#true} is VALID [2022-02-20 18:56:21,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {41923#true} assume ~send3~0 == ~id3~0; {41923#true} is VALID [2022-02-20 18:56:21,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {41923#true} assume 0 == ~mode3~0 % 256; {41923#true} is VALID [2022-02-20 18:56:21,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {41923#true} assume ~id4~0 >= 0; {41923#true} is VALID [2022-02-20 18:56:21,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {41923#true} assume 0 == ~st4~0; {41923#true} is VALID [2022-02-20 18:56:21,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {41923#true} assume ~send4~0 == ~id4~0; {41923#true} is VALID [2022-02-20 18:56:21,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {41923#true} assume 0 == ~mode4~0 % 256; {41923#true} is VALID [2022-02-20 18:56:21,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {41923#true} assume ~id5~0 >= 0; {41923#true} is VALID [2022-02-20 18:56:21,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {41923#true} assume 0 == ~st5~0; {41923#true} is VALID [2022-02-20 18:56:21,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {41923#true} assume ~send5~0 == ~id5~0; {41923#true} is VALID [2022-02-20 18:56:21,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {41923#true} assume 0 == ~mode5~0 % 256; {41923#true} is VALID [2022-02-20 18:56:21,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {41923#true} assume ~id6~0 >= 0; {41923#true} is VALID [2022-02-20 18:56:21,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {41923#true} assume 0 == ~st6~0; {41923#true} is VALID [2022-02-20 18:56:21,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {41923#true} assume ~send6~0 == ~id6~0; {41923#true} is VALID [2022-02-20 18:56:21,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {41923#true} assume 0 == ~mode6~0 % 256; {41923#true} is VALID [2022-02-20 18:56:21,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {41923#true} assume ~id7~0 >= 0; {41923#true} is VALID [2022-02-20 18:56:21,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {41923#true} assume 0 == ~st7~0; {41923#true} is VALID [2022-02-20 18:56:21,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {41923#true} assume ~send7~0 == ~id7~0; {41923#true} is VALID [2022-02-20 18:56:21,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {41923#true} assume 0 == ~mode7~0 % 256; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,655 INFO L290 TraceCheckUtils]: 37: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,658 INFO L290 TraceCheckUtils]: 47: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28553~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28553~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,661 INFO L290 TraceCheckUtils]: 53: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume main_~main__i2~0#1 < 14;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,661 INFO L290 TraceCheckUtils]: 54: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,661 INFO L290 TraceCheckUtils]: 55: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send1~0 != ~nomsg~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,662 INFO L290 TraceCheckUtils]: 56: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,662 INFO L290 TraceCheckUtils]: 58: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,663 INFO L290 TraceCheckUtils]: 60: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send2~0 != ~nomsg~0); {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send3~0 != ~nomsg~0); {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,666 INFO L290 TraceCheckUtils]: 67: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,666 INFO L290 TraceCheckUtils]: 68: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,667 INFO L290 TraceCheckUtils]: 70: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send4~0 != ~nomsg~0); {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,667 INFO L290 TraceCheckUtils]: 71: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,667 INFO L290 TraceCheckUtils]: 72: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,668 INFO L290 TraceCheckUtils]: 73: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,668 INFO L290 TraceCheckUtils]: 74: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,668 INFO L290 TraceCheckUtils]: 75: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send5~0 != ~nomsg~0); {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,669 INFO L290 TraceCheckUtils]: 76: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,669 INFO L290 TraceCheckUtils]: 77: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,669 INFO L290 TraceCheckUtils]: 78: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,670 INFO L290 TraceCheckUtils]: 79: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,670 INFO L290 TraceCheckUtils]: 80: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send6~0 != ~nomsg~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,670 INFO L290 TraceCheckUtils]: 81: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~p6_new~0 == ~nomsg~0;main_~node6____CPAchecker_TMP_0~0#1 := ~send6~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,671 INFO L290 TraceCheckUtils]: 82: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p6_new~0 := (if main_~node6____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node6____CPAchecker_TMP_0~0#1 % 256 else main_~node6____CPAchecker_TMP_0~0#1 % 256 - 256);~mode6~0 := 1; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,671 INFO L290 TraceCheckUtils]: 83: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:21,671 INFO L290 TraceCheckUtils]: 84: Hoare triple {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {41924#false} is VALID [2022-02-20 18:56:21,671 INFO L290 TraceCheckUtils]: 85: Hoare triple {41924#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {41924#false} is VALID [2022-02-20 18:56:21,672 INFO L290 TraceCheckUtils]: 86: Hoare triple {41924#false} ~mode7~0 := 0; {41924#false} is VALID [2022-02-20 18:56:21,672 INFO L290 TraceCheckUtils]: 87: Hoare triple {41924#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {41924#false} is VALID [2022-02-20 18:56:21,672 INFO L290 TraceCheckUtils]: 88: Hoare triple {41924#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {41924#false} is VALID [2022-02-20 18:56:21,672 INFO L290 TraceCheckUtils]: 89: Hoare triple {41924#false} ~__return_28705~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28705~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; {41924#false} is VALID [2022-02-20 18:56:21,672 INFO L290 TraceCheckUtils]: 90: Hoare triple {41924#false} assume 0 == main_~assert__arg~0#1 % 256; {41924#false} is VALID [2022-02-20 18:56:21,672 INFO L290 TraceCheckUtils]: 91: Hoare triple {41924#false} assume !false; {41924#false} is VALID [2022-02-20 18:56:21,672 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:56:21,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:21,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389158720] [2022-02-20 18:56:21,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389158720] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:21,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:21,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:21,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227767634] [2022-02-20 18:56:21,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:21,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:56:21,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:21,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:21,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:21,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:21,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:21,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:21,728 INFO L87 Difference]: Start difference. First operand 3511 states and 5430 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:26,156 INFO L93 Difference]: Finished difference Result 9915 states and 15352 transitions. [2022-02-20 18:56:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:56:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:26,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:56:26,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:27,954 INFO L225 Difference]: With dead ends: 9915 [2022-02-20 18:56:27,954 INFO L226 Difference]: Without dead ends: 6457 [2022-02-20 18:56:27,957 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:56:27,958 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 87 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:27,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 388 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2022-02-20 18:56:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 6455. [2022-02-20 18:56:28,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:28,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6457 states. Second operand has 6455 states, 6454 states have (on average 1.5354818717074683) internal successors, (9910), 6454 states have internal predecessors, (9910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:28,203 INFO L74 IsIncluded]: Start isIncluded. First operand 6457 states. Second operand has 6455 states, 6454 states have (on average 1.5354818717074683) internal successors, (9910), 6454 states have internal predecessors, (9910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:28,209 INFO L87 Difference]: Start difference. First operand 6457 states. Second operand has 6455 states, 6454 states have (on average 1.5354818717074683) internal successors, (9910), 6454 states have internal predecessors, (9910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:29,457 INFO L93 Difference]: Finished difference Result 6457 states and 9911 transitions. [2022-02-20 18:56:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6457 states and 9911 transitions. [2022-02-20 18:56:29,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:29,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:29,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 6455 states, 6454 states have (on average 1.5354818717074683) internal successors, (9910), 6454 states have internal predecessors, (9910), 0 states have call successors, (0), 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 6457 states. [2022-02-20 18:56:29,474 INFO L87 Difference]: Start difference. First operand has 6455 states, 6454 states have (on average 1.5354818717074683) internal successors, (9910), 6454 states have internal predecessors, (9910), 0 states have call successors, (0), 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 6457 states. [2022-02-20 18:56:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:30,726 INFO L93 Difference]: Finished difference Result 6457 states and 9911 transitions. [2022-02-20 18:56:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6457 states and 9911 transitions. [2022-02-20 18:56:30,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:30,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:30,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:30,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6455 states, 6454 states have (on average 1.5354818717074683) internal successors, (9910), 6454 states have internal predecessors, (9910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6455 states to 6455 states and 9910 transitions. [2022-02-20 18:56:32,507 INFO L78 Accepts]: Start accepts. Automaton has 6455 states and 9910 transitions. Word has length 92 [2022-02-20 18:56:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:32,507 INFO L470 AbstractCegarLoop]: Abstraction has 6455 states and 9910 transitions. [2022-02-20 18:56:32,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6455 states and 9910 transitions. [2022-02-20 18:56:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 18:56:32,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:32,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:32,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:56:32,509 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:32,509 INFO L85 PathProgramCache]: Analyzing trace with hash -450885343, now seen corresponding path program 1 times [2022-02-20 18:56:32,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:32,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962817919] [2022-02-20 18:56:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:32,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {77868#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(49, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28553~0 := 0;~__return_28705~0 := 0;~__return_28809~0 := 0; {77868#true} is VALID [2022-02-20 18:56:32,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {77868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {77868#true} is VALID [2022-02-20 18:56:32,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {77868#true} assume 0 == ~r1~0; {77868#true} is VALID [2022-02-20 18:56:32,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {77868#true} assume ~id1~0 >= 0; {77868#true} is VALID [2022-02-20 18:56:32,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {77868#true} assume 0 == ~st1~0; {77870#(<= ~st1~0 0)} is VALID [2022-02-20 18:56:32,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {77870#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {77870#(<= ~st1~0 0)} is VALID [2022-02-20 18:56:32,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {77870#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {77870#(<= ~st1~0 0)} is VALID [2022-02-20 18:56:32,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {77870#(<= ~st1~0 0)} assume ~id2~0 >= 0; {77870#(<= ~st1~0 0)} is VALID [2022-02-20 18:56:32,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {77870#(<= ~st1~0 0)} assume 0 == ~st2~0; {77871#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {77871#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {77871#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {77871#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {77871#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {77871#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {77871#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {77871#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {77872#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {77872#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {77872#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {77872#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {77872#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {77872#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {77872#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {77872#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {77873#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {77873#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {77873#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {77873#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {77873#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {77873#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {77873#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {77873#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {77874#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {77874#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {77874#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {77874#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {77874#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {77874#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {77874#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:32,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {77874#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {77875#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {77875#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {77875#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {77875#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {77875#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {77875#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {77875#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {77875#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28553~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28553~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume main_~main__i2~0#1 < 14;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,661 INFO L290 TraceCheckUtils]: 55: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send2~0 != ~nomsg~0); {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,665 INFO L290 TraceCheckUtils]: 62: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,666 INFO L290 TraceCheckUtils]: 64: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,666 INFO L290 TraceCheckUtils]: 65: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send3~0 != ~nomsg~0); {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,667 INFO L290 TraceCheckUtils]: 66: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,667 INFO L290 TraceCheckUtils]: 67: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,667 INFO L290 TraceCheckUtils]: 68: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,668 INFO L290 TraceCheckUtils]: 69: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,668 INFO L290 TraceCheckUtils]: 70: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send4~0 != ~nomsg~0); {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,669 INFO L290 TraceCheckUtils]: 71: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,669 INFO L290 TraceCheckUtils]: 72: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,670 INFO L290 TraceCheckUtils]: 74: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,670 INFO L290 TraceCheckUtils]: 75: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send5~0 != ~nomsg~0); {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,672 INFO L290 TraceCheckUtils]: 78: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,672 INFO L290 TraceCheckUtils]: 79: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,673 INFO L290 TraceCheckUtils]: 80: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,673 INFO L290 TraceCheckUtils]: 81: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~p6_new~0 == ~nomsg~0;main_~node6____CPAchecker_TMP_0~0#1 := ~send6~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,673 INFO L290 TraceCheckUtils]: 82: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if main_~node6____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node6____CPAchecker_TMP_0~0#1 % 256 else main_~node6____CPAchecker_TMP_0~0#1 % 256 - 256);~mode6~0 := 1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,674 INFO L290 TraceCheckUtils]: 83: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,674 INFO L290 TraceCheckUtils]: 84: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode7~0 % 256);havoc main_~node7____CPAchecker_TMP_0~0#1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,675 INFO L290 TraceCheckUtils]: 85: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send7~0 != ~nomsg~0); {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,675 INFO L290 TraceCheckUtils]: 86: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node7____CPAchecker_TMP_0~0#1 := ~p7_new~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,676 INFO L290 TraceCheckUtils]: 87: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if main_~node7____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node7____CPAchecker_TMP_0~0#1 % 256 else main_~node7____CPAchecker_TMP_0~0#1 % 256 - 256);~mode7~0 := 1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,676 INFO L290 TraceCheckUtils]: 88: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:32,677 INFO L290 TraceCheckUtils]: 89: Hoare triple {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {77869#false} is VALID [2022-02-20 18:56:32,677 INFO L290 TraceCheckUtils]: 90: Hoare triple {77869#false} ~__return_28705~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28705~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; {77869#false} is VALID [2022-02-20 18:56:32,677 INFO L290 TraceCheckUtils]: 91: Hoare triple {77869#false} assume 0 == main_~assert__arg~0#1 % 256; {77869#false} is VALID [2022-02-20 18:56:32,677 INFO L290 TraceCheckUtils]: 92: Hoare triple {77869#false} assume !false; {77869#false} is VALID [2022-02-20 18:56:32,678 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:56:32,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:32,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962817919] [2022-02-20 18:56:32,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962817919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:32,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:32,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:56:32,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916019312] [2022-02-20 18:56:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:56:32,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:32,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:32,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:32,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:56:32,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:32,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:56:32,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:56:32,759 INFO L87 Difference]: Start difference. First operand 6455 states and 9910 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)