./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.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.1.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 3cf612fb43c98d640569a1c9328794313185fe1b6a4dbfc7e502cbb16fa8754d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:55:45,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:55:45,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:55:45,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:55:45,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:55:45,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:55:45,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:55:45,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:55:45,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:55:45,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:55:45,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:55:45,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:55:45,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:55:45,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:55:45,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:55:45,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:55:45,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:55:45,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:55:45,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:55:45,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:55:45,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:55:45,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:55:45,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:55:45,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:55:45,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:55:45,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:55:45,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:55:45,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:55:45,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:55:45,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:55:45,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:55:45,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:55:45,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:55:45,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:55:45,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:55:45,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:55:45,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:55:45,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:55:45,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:55:45,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:55:45,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:55:45,634 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:55:45,647 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:55:45,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:55:45,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:55:45,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:55:45,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:55:45,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:55:45,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:55:45,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:55:45,654 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:55:45,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:55:45,655 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:55:45,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:55:45,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:55:45,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:55:45,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:55:45,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:55:45,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:55:45,656 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:55:45,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:55:45,656 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:55:45,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:55:45,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:55:45,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:55:45,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:55:45,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:55:45,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:55:45,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:55:45,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:55:45,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:55:45,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:55:45,658 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:55:45,659 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:55:45,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:55:45,659 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 -> 3cf612fb43c98d640569a1c9328794313185fe1b6a4dbfc7e502cbb16fa8754d [2022-02-20 18:55:45,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:55:45,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:55:45,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:55:45,908 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:55:45,909 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:55:45,910 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.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2022-02-20 18:55:45,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc60ad48b/812f4fe810be493ebe7cecd205298e92/FLAG939cf9a77 [2022-02-20 18:55:46,324 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:55:46,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2022-02-20 18:55:46,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc60ad48b/812f4fe810be493ebe7cecd205298e92/FLAG939cf9a77 [2022-02-20 18:55:46,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc60ad48b/812f4fe810be493ebe7cecd205298e92 [2022-02-20 18:55:46,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:55:46,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:55:46,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:55:46,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:55:46,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:55:46,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:55:46" (1/1) ... [2022-02-20 18:55:46,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117a6125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:46, skipping insertion in model container [2022-02-20 18:55:46,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:55:46" (1/1) ... [2022-02-20 18:55:46,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:55:46,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:55:46,964 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.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7633,7646] [2022-02-20 18:55:46,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:55:47,008 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:55:47,040 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.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7633,7646] [2022-02-20 18:55:47,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:55:47,069 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:55:47,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47 WrapperNode [2022-02-20 18:55:47,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:55:47,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:55:47,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:55:47,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:55:47,075 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:55:47" (1/1) ... [2022-02-20 18:55:47,088 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:55:47" (1/1) ... [2022-02-20 18:55:47,122 INFO L137 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 577 [2022-02-20 18:55:47,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:55:47,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:55:47,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:55:47,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:55:47,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47" (1/1) ... [2022-02-20 18:55:47,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47" (1/1) ... [2022-02-20 18:55:47,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47" (1/1) ... [2022-02-20 18:55:47,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47" (1/1) ... [2022-02-20 18:55:47,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47" (1/1) ... [2022-02-20 18:55:47,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47" (1/1) ... [2022-02-20 18:55:47,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47" (1/1) ... [2022-02-20 18:55:47,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:55:47,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:55:47,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:55:47,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:55:47,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47" (1/1) ... [2022-02-20 18:55:47,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:55:47,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:55:47,188 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:55:47,193 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:55:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:55:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:55:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:55:47,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:55:47,340 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:55:47,354 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:55:47,951 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:55:47,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:55:47,960 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:55:47,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:55:47 BoogieIcfgContainer [2022-02-20 18:55:47,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:55:47,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:55:47,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:55:47,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:55:47,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:55:46" (1/3) ... [2022-02-20 18:55:47,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a37295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:55:47, skipping insertion in model container [2022-02-20 18:55:47,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:47" (2/3) ... [2022-02-20 18:55:47,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a37295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:55:47, skipping insertion in model container [2022-02-20 18:55:47,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:55:47" (3/3) ... [2022-02-20 18:55:47,970 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2022-02-20 18:55:47,976 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:55:47,976 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:55:48,017 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:55:48,023 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:55:48,023 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:55:48,047 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:55:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 18:55:48,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:48,057 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:55:48,057 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash -313177950, now seen corresponding path program 1 times [2022-02-20 18:55:48,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:48,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324574079] [2022-02-20 18:55:48,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:48,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:48,411 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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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_28618~0 := 0;~__return_28770~0 := 0;~__return_28875~0 := 0; {139#true} is VALID [2022-02-20 18:55:48,412 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:55:48,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume 0 == ~r1~0; {139#true} is VALID [2022-02-20 18:55:48,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {139#true} assume ~id1~0 >= 0; {139#true} is VALID [2022-02-20 18:55:48,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {139#true} assume 0 == ~st1~0; {139#true} is VALID [2022-02-20 18:55:48,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} assume ~send1~0 == ~id1~0; {139#true} is VALID [2022-02-20 18:55:48,418 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:55:48,418 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:55:48,419 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:55:48,419 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:55:48,420 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:55:48,421 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:55:48,421 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:55:48,422 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:55:48,422 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:55:48,423 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:55:48,423 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:55:48,424 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:55:48,425 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:55:48,425 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:55:48,426 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:55:48,427 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:55:48,427 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:55:48,428 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:55:48,429 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:55:48,430 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:55:48,430 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:55:48,431 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:55:48,431 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:55:48,432 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:55:48,432 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:55:48,433 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:55:48,433 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:55:48,434 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:55:48,434 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:55:48,435 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:55:48,435 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:55:48,436 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:55:48,436 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:55:48,437 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:55:48,438 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:55:48,438 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:55:48,439 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:55:48,439 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:55:48,440 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:55:48,441 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:55:48,442 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:55:48,442 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:55:48,443 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:55:48,444 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:55:48,444 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:55:48,445 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_28618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28618~0; {141#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:55:48,445 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:55:48,446 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:55:48,447 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:55:48,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {140#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:55:48,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {140#false} ~mode1~0 := 0; {140#false} is VALID [2022-02-20 18:55:48,447 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:55:48,448 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:55:48,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {140#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:55:48,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {140#false} ~mode2~0 := 0; {140#false} is VALID [2022-02-20 18:55:48,448 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:55:48,448 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:55:48,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {140#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:55:48,449 INFO L290 TraceCheckUtils]: 64: Hoare triple {140#false} ~mode3~0 := 0; {140#false} is VALID [2022-02-20 18:55:48,449 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:55:48,449 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:55:48,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {140#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:55:48,449 INFO L290 TraceCheckUtils]: 68: Hoare triple {140#false} ~mode4~0 := 0; {140#false} is VALID [2022-02-20 18:55:48,450 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:55:48,450 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:55:48,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {140#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:55:48,450 INFO L290 TraceCheckUtils]: 72: Hoare triple {140#false} ~mode5~0 := 0; {140#false} is VALID [2022-02-20 18:55:48,450 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:55:48,451 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:55:48,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {140#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:55:48,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {140#false} ~mode6~0 := 0; {140#false} is VALID [2022-02-20 18:55:48,451 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:55:48,451 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:55:48,452 INFO L290 TraceCheckUtils]: 79: Hoare triple {140#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {140#false} is VALID [2022-02-20 18:55:48,452 INFO L290 TraceCheckUtils]: 80: Hoare triple {140#false} ~mode7~0 := 0; {140#false} is VALID [2022-02-20 18:55:48,452 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:55:48,452 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:55:48,453 INFO L290 TraceCheckUtils]: 83: Hoare triple {140#false} ~__return_28770~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28770~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:55:48,456 INFO L290 TraceCheckUtils]: 84: Hoare triple {140#false} assume 0 == main_~assert__arg~0#1 % 256; {140#false} is VALID [2022-02-20 18:55:48,456 INFO L290 TraceCheckUtils]: 85: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-02-20 18:55:48,459 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:55:48,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:48,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324574079] [2022-02-20 18:55:48,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324574079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:48,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:48,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:48,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104002484] [2022-02-20 18:55:48,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:48,471 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:55:48,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:48,476 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:55:48,547 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:55:48,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:48,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:48,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:48,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:48,562 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:55:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:48,921 INFO L93 Difference]: Finished difference Result 294 states and 484 transitions. [2022-02-20 18:55:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:48,922 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:55:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:48,923 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:55:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-02-20 18:55:48,945 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:55:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-02-20 18:55:48,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 484 transitions. [2022-02-20 18:55:49,301 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:55:49,322 INFO L225 Difference]: With dead ends: 294 [2022-02-20 18:55:49,322 INFO L226 Difference]: Without dead ends: 205 [2022-02-20 18:55:49,325 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:55:49,330 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:55:49,330 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:55:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-02-20 18:55:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2022-02-20 18:55:49,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:49,365 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:55:49,367 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:55:49,368 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:55:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:49,374 INFO L93 Difference]: Finished difference Result 205 states and 293 transitions. [2022-02-20 18:55:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 293 transitions. [2022-02-20 18:55:49,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:49,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:49,376 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:55:49,377 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:55:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:49,383 INFO L93 Difference]: Finished difference Result 205 states and 293 transitions. [2022-02-20 18:55:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 293 transitions. [2022-02-20 18:55:49,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:49,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:49,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:49,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:49,385 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:55:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2022-02-20 18:55:49,391 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 86 [2022-02-20 18:55:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:49,391 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2022-02-20 18:55:49,392 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:55:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2022-02-20 18:55:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-20 18:55:49,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:49,394 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:55:49,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:55:49,394 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash 982762601, now seen corresponding path program 1 times [2022-02-20 18:55:49,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:49,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778275485] [2022-02-20 18:55:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:49,549 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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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_28618~0 := 0;~__return_28770~0 := 0;~__return_28875~0 := 0; {1203#true} is VALID [2022-02-20 18:55:49,550 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:55:49,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {1203#true} assume 0 == ~r1~0; {1203#true} is VALID [2022-02-20 18:55:49,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {1203#true} assume ~id1~0 >= 0; {1203#true} is VALID [2022-02-20 18:55:49,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {1203#true} assume 0 == ~st1~0; {1203#true} is VALID [2022-02-20 18:55:49,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {1203#true} assume ~send1~0 == ~id1~0; {1203#true} is VALID [2022-02-20 18:55:49,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {1203#true} assume 0 == ~mode1~0 % 256; {1203#true} is VALID [2022-02-20 18:55:49,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {1203#true} assume ~id2~0 >= 0; {1203#true} is VALID [2022-02-20 18:55:49,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#true} assume 0 == ~st2~0; {1203#true} is VALID [2022-02-20 18:55:49,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {1203#true} assume ~send2~0 == ~id2~0; {1203#true} is VALID [2022-02-20 18:55:49,551 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:55:49,552 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:55:49,552 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:55:49,553 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:55:49,553 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:55:49,554 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:55:49,554 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:55:49,554 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:55:49,555 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:55:49,557 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:55:49,557 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:55:49,558 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:55:49,558 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:55:49,558 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:55:49,559 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:55:49,559 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:55:49,560 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:55:49,560 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:55:49,561 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:55:49,562 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:55:49,562 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:55:49,564 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:55:49,564 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:55:49,574 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:55:49,575 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:55:49,575 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:55:49,576 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:55:49,576 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:55:49,576 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:55:49,577 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:55:49,577 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:55:49,578 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:55:49,578 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:55:49,578 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:55:49,579 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:55:49,579 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:55:49,580 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:55:49,580 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:55:49,580 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:55:49,581 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:55:49,581 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:55:49,581 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_28618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28618~0; {1205#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:49,582 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:55:49,582 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:55:49,583 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:55:49,583 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:55:49,584 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:55:49,584 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:55:49,584 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:55:49,585 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:55:49,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {1204#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:55:49,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {1204#false} ~mode2~0 := 0; {1204#false} is VALID [2022-02-20 18:55:49,585 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:55:49,586 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:55:49,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {1204#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:55:49,586 INFO L290 TraceCheckUtils]: 65: Hoare triple {1204#false} ~mode3~0 := 0; {1204#false} is VALID [2022-02-20 18:55:49,586 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:55:49,586 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:55:49,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {1204#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:55:49,586 INFO L290 TraceCheckUtils]: 69: Hoare triple {1204#false} ~mode4~0 := 0; {1204#false} is VALID [2022-02-20 18:55:49,587 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:55:49,587 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:55:49,587 INFO L290 TraceCheckUtils]: 72: Hoare triple {1204#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:55:49,587 INFO L290 TraceCheckUtils]: 73: Hoare triple {1204#false} ~mode5~0 := 0; {1204#false} is VALID [2022-02-20 18:55:49,587 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:55:49,587 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:55:49,587 INFO L290 TraceCheckUtils]: 76: Hoare triple {1204#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:55:49,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {1204#false} ~mode6~0 := 0; {1204#false} is VALID [2022-02-20 18:55:49,588 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:55:49,588 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:55:49,588 INFO L290 TraceCheckUtils]: 80: Hoare triple {1204#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {1204#false} is VALID [2022-02-20 18:55:49,588 INFO L290 TraceCheckUtils]: 81: Hoare triple {1204#false} ~mode7~0 := 0; {1204#false} is VALID [2022-02-20 18:55:49,588 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:55:49,588 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:55:49,589 INFO L290 TraceCheckUtils]: 84: Hoare triple {1204#false} ~__return_28770~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28770~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:55:49,589 INFO L290 TraceCheckUtils]: 85: Hoare triple {1204#false} assume 0 == main_~assert__arg~0#1 % 256; {1204#false} is VALID [2022-02-20 18:55:49,589 INFO L290 TraceCheckUtils]: 86: Hoare triple {1204#false} assume !false; {1204#false} is VALID [2022-02-20 18:55:49,589 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:55:49,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:49,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778275485] [2022-02-20 18:55:49,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778275485] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:49,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:49,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:49,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878323261] [2022-02-20 18:55:49,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:49,591 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:55:49,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:49,592 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:55:49,644 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:55:49,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:49,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:49,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:49,646 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:55:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:49,892 INFO L93 Difference]: Finished difference Result 487 states and 744 transitions. [2022-02-20 18:55:49,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:49,893 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:55:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:49,893 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:55:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:49,896 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:55:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:49,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:55:50,174 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:55:50,181 INFO L225 Difference]: With dead ends: 487 [2022-02-20 18:55:50,181 INFO L226 Difference]: Without dead ends: 337 [2022-02-20 18:55:50,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:55:50,182 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:55:50,182 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:55:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-02-20 18:55:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-02-20 18:55:50,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:50,221 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:55:50,222 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:55:50,222 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:55:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:50,230 INFO L93 Difference]: Finished difference Result 337 states and 503 transitions. [2022-02-20 18:55:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 503 transitions. [2022-02-20 18:55:50,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:50,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:50,234 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:55:50,235 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:55:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:50,243 INFO L93 Difference]: Finished difference Result 337 states and 503 transitions. [2022-02-20 18:55:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 503 transitions. [2022-02-20 18:55:50,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:50,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:50,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:50,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:50,244 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:55:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 502 transitions. [2022-02-20 18:55:50,253 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 502 transitions. Word has length 87 [2022-02-20 18:55:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:50,255 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 502 transitions. [2022-02-20 18:55:50,255 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:55:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 502 transitions. [2022-02-20 18:55:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 18:55:50,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:50,257 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:55:50,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:55:50,258 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 914543768, now seen corresponding path program 1 times [2022-02-20 18:55:50,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:50,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168712410] [2022-02-20 18:55:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:50,331 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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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_28618~0 := 0;~__return_28770~0 := 0;~__return_28875~0 := 0; {2987#true} is VALID [2022-02-20 18:55:50,332 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:55:50,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {2987#true} assume 0 == ~r1~0; {2987#true} is VALID [2022-02-20 18:55:50,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {2987#true} assume ~id1~0 >= 0; {2987#true} is VALID [2022-02-20 18:55:50,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {2987#true} assume 0 == ~st1~0; {2987#true} is VALID [2022-02-20 18:55:50,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {2987#true} assume ~send1~0 == ~id1~0; {2987#true} is VALID [2022-02-20 18:55:50,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {2987#true} assume 0 == ~mode1~0 % 256; {2987#true} is VALID [2022-02-20 18:55:50,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {2987#true} assume ~id2~0 >= 0; {2987#true} is VALID [2022-02-20 18:55:50,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {2987#true} assume 0 == ~st2~0; {2987#true} is VALID [2022-02-20 18:55:50,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {2987#true} assume ~send2~0 == ~id2~0; {2987#true} is VALID [2022-02-20 18:55:50,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {2987#true} assume 0 == ~mode2~0 % 256; {2987#true} is VALID [2022-02-20 18:55:50,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {2987#true} assume ~id3~0 >= 0; {2987#true} is VALID [2022-02-20 18:55:50,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {2987#true} assume 0 == ~st3~0; {2987#true} is VALID [2022-02-20 18:55:50,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {2987#true} assume ~send3~0 == ~id3~0; {2987#true} is VALID [2022-02-20 18:55:50,335 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:55:50,335 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:55:50,336 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:55:50,336 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:55:50,336 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:55:50,339 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:55:50,340 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:55:50,341 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:55:50,341 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:55:50,341 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:55:50,342 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:55:50,342 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:55:50,342 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:55:50,344 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:55:50,344 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:55:50,344 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:55:50,345 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:55:50,347 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:55:50,348 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:55:50,348 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:55:50,348 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:55:50,349 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:55:50,349 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:55:50,349 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:55:50,350 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:55:50,351 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:55:50,352 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:55:50,352 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:55:50,352 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:55:50,353 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:55:50,353 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:55:50,353 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:55:50,354 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:55:50,354 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:55:50,354 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:55:50,355 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:55:50,355 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:55:50,355 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_28618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28618~0; {2989#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:50,356 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:55:50,356 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:55:50,357 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:55:50,357 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:55:50,357 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:55:50,358 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:55:50,358 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:55:50,359 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:55:50,359 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:55:50,359 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:55:50,360 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:55:50,360 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:55:50,361 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:55:50,361 INFO L290 TraceCheckUtils]: 65: Hoare triple {2988#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:55:50,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {2988#false} ~mode3~0 := 0; {2988#false} is VALID [2022-02-20 18:55:50,361 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:55:50,361 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:55:50,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {2988#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:55:50,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {2988#false} ~mode4~0 := 0; {2988#false} is VALID [2022-02-20 18:55:50,361 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:55:50,362 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:55:50,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {2988#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:55:50,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {2988#false} ~mode5~0 := 0; {2988#false} is VALID [2022-02-20 18:55:50,362 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:55:50,362 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:55:50,362 INFO L290 TraceCheckUtils]: 77: Hoare triple {2988#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:55:50,362 INFO L290 TraceCheckUtils]: 78: Hoare triple {2988#false} ~mode6~0 := 0; {2988#false} is VALID [2022-02-20 18:55:50,362 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:55:50,363 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:55:50,363 INFO L290 TraceCheckUtils]: 81: Hoare triple {2988#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {2988#false} is VALID [2022-02-20 18:55:50,363 INFO L290 TraceCheckUtils]: 82: Hoare triple {2988#false} ~mode7~0 := 0; {2988#false} is VALID [2022-02-20 18:55:50,363 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:55:50,363 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:55:50,363 INFO L290 TraceCheckUtils]: 85: Hoare triple {2988#false} ~__return_28770~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28770~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:55:50,363 INFO L290 TraceCheckUtils]: 86: Hoare triple {2988#false} assume 0 == main_~assert__arg~0#1 % 256; {2988#false} is VALID [2022-02-20 18:55:50,364 INFO L290 TraceCheckUtils]: 87: Hoare triple {2988#false} assume !false; {2988#false} is VALID [2022-02-20 18:55:50,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:55:50,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:50,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168712410] [2022-02-20 18:55:50,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168712410] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:50,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:50,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:50,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359275667] [2022-02-20 18:55:50,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:50,367 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:55:50,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:50,370 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:55:50,426 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:55:50,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:50,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:50,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:50,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:50,427 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:55:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:50,675 INFO L93 Difference]: Finished difference Result 867 states and 1348 transitions. [2022-02-20 18:55:50,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:50,675 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:55:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:50,675 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:55:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:50,678 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:55:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:50,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:55:50,951 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:55:50,967 INFO L225 Difference]: With dead ends: 867 [2022-02-20 18:55:50,967 INFO L226 Difference]: Without dead ends: 585 [2022-02-20 18:55:50,968 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:55:50,969 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:55:50,970 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:55:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-02-20 18:55:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 583. [2022-02-20 18:55:51,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:51,008 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:55:51,009 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:55:51,010 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:55:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:51,025 INFO L93 Difference]: Finished difference Result 585 states and 895 transitions. [2022-02-20 18:55:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 895 transitions. [2022-02-20 18:55:51,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:51,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:51,034 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:55:51,035 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:55:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:51,051 INFO L93 Difference]: Finished difference Result 585 states and 895 transitions. [2022-02-20 18:55:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 895 transitions. [2022-02-20 18:55:51,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:51,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:51,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:51,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:51,054 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:55:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 894 transitions. [2022-02-20 18:55:51,072 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 894 transitions. Word has length 88 [2022-02-20 18:55:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:51,072 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 894 transitions. [2022-02-20 18:55:51,072 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:55:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 894 transitions. [2022-02-20 18:55:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-20 18:55:51,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:51,073 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:55:51,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:55:51,074 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 349801040, now seen corresponding path program 1 times [2022-02-20 18:55:51,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:51,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109153927] [2022-02-20 18:55:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:51,143 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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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_28618~0 := 0;~__return_28770~0 := 0;~__return_28875~0 := 0; {6148#true} is VALID [2022-02-20 18:55:51,143 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:55:51,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {6148#true} assume 0 == ~r1~0; {6148#true} is VALID [2022-02-20 18:55:51,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {6148#true} assume ~id1~0 >= 0; {6148#true} is VALID [2022-02-20 18:55:51,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {6148#true} assume 0 == ~st1~0; {6148#true} is VALID [2022-02-20 18:55:51,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {6148#true} assume ~send1~0 == ~id1~0; {6148#true} is VALID [2022-02-20 18:55:51,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {6148#true} assume 0 == ~mode1~0 % 256; {6148#true} is VALID [2022-02-20 18:55:51,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {6148#true} assume ~id2~0 >= 0; {6148#true} is VALID [2022-02-20 18:55:51,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {6148#true} assume 0 == ~st2~0; {6148#true} is VALID [2022-02-20 18:55:51,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {6148#true} assume ~send2~0 == ~id2~0; {6148#true} is VALID [2022-02-20 18:55:51,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {6148#true} assume 0 == ~mode2~0 % 256; {6148#true} is VALID [2022-02-20 18:55:51,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {6148#true} assume ~id3~0 >= 0; {6148#true} is VALID [2022-02-20 18:55:51,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {6148#true} assume 0 == ~st3~0; {6148#true} is VALID [2022-02-20 18:55:51,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {6148#true} assume ~send3~0 == ~id3~0; {6148#true} is VALID [2022-02-20 18:55:51,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {6148#true} assume 0 == ~mode3~0 % 256; {6148#true} is VALID [2022-02-20 18:55:51,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {6148#true} assume ~id4~0 >= 0; {6148#true} is VALID [2022-02-20 18:55:51,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {6148#true} assume 0 == ~st4~0; {6148#true} is VALID [2022-02-20 18:55:51,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {6148#true} assume ~send4~0 == ~id4~0; {6148#true} is VALID [2022-02-20 18:55:51,146 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:55:51,147 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:55:51,147 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:55:51,147 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:55:51,148 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:55:51,148 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:55:51,149 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:55:51,149 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:55:51,149 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:55:51,150 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:55:51,150 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:55:51,150 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:55:51,151 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:55:51,151 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:55:51,152 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:55:51,152 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:55:51,152 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:55:51,153 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:55:51,153 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:55:51,153 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:55:51,154 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:55:51,154 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:55:51,154 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:55:51,155 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:55:51,155 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:55:51,156 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:55:51,156 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:55:51,157 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:55:51,157 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:55:51,158 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:55:51,158 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:55:51,158 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:55:51,159 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:55:51,159 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_28618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28618~0; {6150#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:51,160 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:55:51,160 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:55:51,160 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:55:51,161 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:55:51,161 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:55:51,162 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:55:51,162 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:55:51,162 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:55:51,163 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:55:51,163 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:55:51,164 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:55:51,164 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:55:51,164 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:55:51,165 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:55:51,165 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:55:51,165 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:55:51,166 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:55:51,166 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:55:51,166 INFO L290 TraceCheckUtils]: 70: Hoare triple {6149#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {6149#false} is VALID [2022-02-20 18:55:51,167 INFO L290 TraceCheckUtils]: 71: Hoare triple {6149#false} ~mode4~0 := 0; {6149#false} is VALID [2022-02-20 18:55:51,167 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:55:51,167 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:55:51,167 INFO L290 TraceCheckUtils]: 74: Hoare triple {6149#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {6149#false} is VALID [2022-02-20 18:55:51,167 INFO L290 TraceCheckUtils]: 75: Hoare triple {6149#false} ~mode5~0 := 0; {6149#false} is VALID [2022-02-20 18:55:51,167 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:55:51,167 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:55:51,168 INFO L290 TraceCheckUtils]: 78: Hoare triple {6149#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {6149#false} is VALID [2022-02-20 18:55:51,168 INFO L290 TraceCheckUtils]: 79: Hoare triple {6149#false} ~mode6~0 := 0; {6149#false} is VALID [2022-02-20 18:55:51,168 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:55:51,168 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:55:51,168 INFO L290 TraceCheckUtils]: 82: Hoare triple {6149#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {6149#false} is VALID [2022-02-20 18:55:51,168 INFO L290 TraceCheckUtils]: 83: Hoare triple {6149#false} ~mode7~0 := 0; {6149#false} is VALID [2022-02-20 18:55:51,168 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:55:51,169 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:55:51,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {6149#false} ~__return_28770~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28770~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:55:51,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {6149#false} assume 0 == main_~assert__arg~0#1 % 256; {6149#false} is VALID [2022-02-20 18:55:51,169 INFO L290 TraceCheckUtils]: 88: Hoare triple {6149#false} assume !false; {6149#false} is VALID [2022-02-20 18:55:51,169 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:55:51,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:51,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109153927] [2022-02-20 18:55:51,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109153927] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:51,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:51,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:51,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074912828] [2022-02-20 18:55:51,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:51,171 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:55:51,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:51,171 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:55:51,227 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:55:51,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:51,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:51,228 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:55:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:51,557 INFO L93 Difference]: Finished difference Result 1579 states and 2472 transitions. [2022-02-20 18:55:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:51,557 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:55:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:51,557 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:55:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:51,559 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:55:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:51,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:55:51,811 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:55:51,859 INFO L225 Difference]: With dead ends: 1579 [2022-02-20 18:55:51,859 INFO L226 Difference]: Without dead ends: 1049 [2022-02-20 18:55:51,860 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:55:51,861 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:55:51,861 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:55:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-02-20 18:55:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1047. [2022-02-20 18:55:51,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:51,900 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:55:51,902 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:55:51,904 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:55:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:51,957 INFO L93 Difference]: Finished difference Result 1049 states and 1623 transitions. [2022-02-20 18:55:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1623 transitions. [2022-02-20 18:55:51,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:51,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:51,961 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:55:51,962 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:55:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:51,995 INFO L93 Difference]: Finished difference Result 1049 states and 1623 transitions. [2022-02-20 18:55:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1623 transitions. [2022-02-20 18:55:51,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:51,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:51,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:51,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:51,998 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:55:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1622 transitions. [2022-02-20 18:55:52,039 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1622 transitions. Word has length 89 [2022-02-20 18:55:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:52,039 INFO L470 AbstractCegarLoop]: Abstraction has 1047 states and 1622 transitions. [2022-02-20 18:55:52,039 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:55:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1622 transitions. [2022-02-20 18:55:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 18:55:52,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:52,040 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:55:52,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:55:52,040 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash -248220501, now seen corresponding path program 1 times [2022-02-20 18:55:52,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:52,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738189442] [2022-02-20 18:55:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:52,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:52,107 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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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_28618~0 := 0;~__return_28770~0 := 0;~__return_28875~0 := 0; {11889#true} is VALID [2022-02-20 18:55:52,107 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:55:52,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {11889#true} assume 0 == ~r1~0; {11889#true} is VALID [2022-02-20 18:55:52,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {11889#true} assume ~id1~0 >= 0; {11889#true} is VALID [2022-02-20 18:55:52,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {11889#true} assume 0 == ~st1~0; {11889#true} is VALID [2022-02-20 18:55:52,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {11889#true} assume ~send1~0 == ~id1~0; {11889#true} is VALID [2022-02-20 18:55:52,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {11889#true} assume 0 == ~mode1~0 % 256; {11889#true} is VALID [2022-02-20 18:55:52,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {11889#true} assume ~id2~0 >= 0; {11889#true} is VALID [2022-02-20 18:55:52,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {11889#true} assume 0 == ~st2~0; {11889#true} is VALID [2022-02-20 18:55:52,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {11889#true} assume ~send2~0 == ~id2~0; {11889#true} is VALID [2022-02-20 18:55:52,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {11889#true} assume 0 == ~mode2~0 % 256; {11889#true} is VALID [2022-02-20 18:55:52,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {11889#true} assume ~id3~0 >= 0; {11889#true} is VALID [2022-02-20 18:55:52,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {11889#true} assume 0 == ~st3~0; {11889#true} is VALID [2022-02-20 18:55:52,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {11889#true} assume ~send3~0 == ~id3~0; {11889#true} is VALID [2022-02-20 18:55:52,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {11889#true} assume 0 == ~mode3~0 % 256; {11889#true} is VALID [2022-02-20 18:55:52,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {11889#true} assume ~id4~0 >= 0; {11889#true} is VALID [2022-02-20 18:55:52,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {11889#true} assume 0 == ~st4~0; {11889#true} is VALID [2022-02-20 18:55:52,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {11889#true} assume ~send4~0 == ~id4~0; {11889#true} is VALID [2022-02-20 18:55:52,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {11889#true} assume 0 == ~mode4~0 % 256; {11889#true} is VALID [2022-02-20 18:55:52,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {11889#true} assume ~id5~0 >= 0; {11889#true} is VALID [2022-02-20 18:55:52,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {11889#true} assume 0 == ~st5~0; {11889#true} is VALID [2022-02-20 18:55:52,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {11889#true} assume ~send5~0 == ~id5~0; {11889#true} is VALID [2022-02-20 18:55:52,110 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:55:52,110 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:55:52,111 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:55:52,111 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:55:52,111 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:55:52,112 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:55:52,112 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:55:52,112 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:55:52,115 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:55:52,115 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:55:52,116 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:55:52,116 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:55:52,116 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:55:52,117 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:55:52,117 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:55:52,117 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:55:52,118 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:55:52,118 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:55:52,118 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:55:52,119 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:55:52,119 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:55:52,121 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:55:52,121 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:55:52,121 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:55:52,122 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:55:52,122 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:55:52,122 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:55:52,123 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:55:52,123 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:55:52,123 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_28618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28618~0; {11891#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:52,124 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:55:52,124 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:55:52,124 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:55:52,125 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:55:52,125 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:55:52,125 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:55:52,126 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:55:52,126 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:55:52,126 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:55:52,127 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:55:52,127 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:55:52,127 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:55:52,128 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:55:52,128 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:55:52,128 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:55:52,129 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:55:52,129 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:55:52,129 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:55:52,130 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:55:52,130 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:55:52,130 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:55:52,131 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:55:52,131 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:55:52,131 INFO L290 TraceCheckUtils]: 75: Hoare triple {11890#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {11890#false} is VALID [2022-02-20 18:55:52,132 INFO L290 TraceCheckUtils]: 76: Hoare triple {11890#false} ~mode5~0 := 0; {11890#false} is VALID [2022-02-20 18:55:52,132 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:55:52,132 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:55:52,132 INFO L290 TraceCheckUtils]: 79: Hoare triple {11890#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {11890#false} is VALID [2022-02-20 18:55:52,132 INFO L290 TraceCheckUtils]: 80: Hoare triple {11890#false} ~mode6~0 := 0; {11890#false} is VALID [2022-02-20 18:55:52,132 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:55:52,132 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:55:52,132 INFO L290 TraceCheckUtils]: 83: Hoare triple {11890#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {11890#false} is VALID [2022-02-20 18:55:52,133 INFO L290 TraceCheckUtils]: 84: Hoare triple {11890#false} ~mode7~0 := 0; {11890#false} is VALID [2022-02-20 18:55:52,134 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:55:52,134 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:55:52,134 INFO L290 TraceCheckUtils]: 87: Hoare triple {11890#false} ~__return_28770~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28770~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:55:52,134 INFO L290 TraceCheckUtils]: 88: Hoare triple {11890#false} assume 0 == main_~assert__arg~0#1 % 256; {11890#false} is VALID [2022-02-20 18:55:52,134 INFO L290 TraceCheckUtils]: 89: Hoare triple {11890#false} assume !false; {11890#false} is VALID [2022-02-20 18:55:52,136 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:55:52,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:52,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738189442] [2022-02-20 18:55:52,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738189442] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:52,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:52,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:52,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185693941] [2022-02-20 18:55:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:52,139 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:55:52,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:52,139 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:55:52,196 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:55:52,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:52,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:52,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:52,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:52,197 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:55:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:52,789 INFO L93 Difference]: Finished difference Result 2907 states and 4552 transitions. [2022-02-20 18:55:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:52,789 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:55:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:52,790 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:55:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:52,792 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:55:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:52,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:55:53,033 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:55:53,190 INFO L225 Difference]: With dead ends: 2907 [2022-02-20 18:55:53,190 INFO L226 Difference]: Without dead ends: 1913 [2022-02-20 18:55:53,191 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:55:53,193 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:55:53,194 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:55:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-02-20 18:55:53,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1911. [2022-02-20 18:55:53,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:53,262 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:55:53,266 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:55:53,268 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:55:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:53,372 INFO L93 Difference]: Finished difference Result 1913 states and 2967 transitions. [2022-02-20 18:55:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2967 transitions. [2022-02-20 18:55:53,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:53,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:53,378 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:55:53,382 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:55:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:53,482 INFO L93 Difference]: Finished difference Result 1913 states and 2967 transitions. [2022-02-20 18:55:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2967 transitions. [2022-02-20 18:55:53,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:53,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:53,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:53,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:53,488 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:55:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2966 transitions. [2022-02-20 18:55:53,628 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2966 transitions. Word has length 90 [2022-02-20 18:55:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:53,628 INFO L470 AbstractCegarLoop]: Abstraction has 1911 states and 2966 transitions. [2022-02-20 18:55:53,628 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:55:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2966 transitions. [2022-02-20 18:55:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 18:55:53,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:53,629 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:55:53,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:55:53,629 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:53,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1910770737, now seen corresponding path program 1 times [2022-02-20 18:55:53,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:53,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048580628] [2022-02-20 18:55:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:53,718 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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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_28618~0 := 0;~__return_28770~0 := 0;~__return_28875~0 := 0; {22442#true} is VALID [2022-02-20 18:55:53,718 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:55:53,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {22442#true} assume 0 == ~r1~0; {22442#true} is VALID [2022-02-20 18:55:53,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {22442#true} assume ~id1~0 >= 0; {22442#true} is VALID [2022-02-20 18:55:53,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {22442#true} assume 0 == ~st1~0; {22442#true} is VALID [2022-02-20 18:55:53,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {22442#true} assume ~send1~0 == ~id1~0; {22442#true} is VALID [2022-02-20 18:55:53,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {22442#true} assume 0 == ~mode1~0 % 256; {22442#true} is VALID [2022-02-20 18:55:53,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {22442#true} assume ~id2~0 >= 0; {22442#true} is VALID [2022-02-20 18:55:53,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {22442#true} assume 0 == ~st2~0; {22442#true} is VALID [2022-02-20 18:55:53,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {22442#true} assume ~send2~0 == ~id2~0; {22442#true} is VALID [2022-02-20 18:55:53,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {22442#true} assume 0 == ~mode2~0 % 256; {22442#true} is VALID [2022-02-20 18:55:53,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {22442#true} assume ~id3~0 >= 0; {22442#true} is VALID [2022-02-20 18:55:53,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {22442#true} assume 0 == ~st3~0; {22442#true} is VALID [2022-02-20 18:55:53,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {22442#true} assume ~send3~0 == ~id3~0; {22442#true} is VALID [2022-02-20 18:55:53,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {22442#true} assume 0 == ~mode3~0 % 256; {22442#true} is VALID [2022-02-20 18:55:53,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {22442#true} assume ~id4~0 >= 0; {22442#true} is VALID [2022-02-20 18:55:53,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {22442#true} assume 0 == ~st4~0; {22442#true} is VALID [2022-02-20 18:55:53,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {22442#true} assume ~send4~0 == ~id4~0; {22442#true} is VALID [2022-02-20 18:55:53,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {22442#true} assume 0 == ~mode4~0 % 256; {22442#true} is VALID [2022-02-20 18:55:53,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {22442#true} assume ~id5~0 >= 0; {22442#true} is VALID [2022-02-20 18:55:53,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {22442#true} assume 0 == ~st5~0; {22442#true} is VALID [2022-02-20 18:55:53,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {22442#true} assume ~send5~0 == ~id5~0; {22442#true} is VALID [2022-02-20 18:55:53,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {22442#true} assume 0 == ~mode5~0 % 256; {22442#true} is VALID [2022-02-20 18:55:53,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {22442#true} assume ~id6~0 >= 0; {22442#true} is VALID [2022-02-20 18:55:53,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {22442#true} assume 0 == ~st6~0; {22442#true} is VALID [2022-02-20 18:55:53,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {22442#true} assume ~send6~0 == ~id6~0; {22442#true} is VALID [2022-02-20 18:55:53,721 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:55:53,722 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:55:53,722 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:55:53,722 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:55:53,723 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:55:53,723 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:55:53,723 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:55:53,724 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:55:53,724 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:55:53,724 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:55:53,724 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:55:53,725 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:55:53,725 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:55:53,725 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:55:53,726 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:55:53,726 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:55:53,726 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:55:53,727 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:55:53,727 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:55:53,727 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:55:53,728 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:55:53,728 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:55:53,728 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:55:53,729 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:55:53,729 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:55:53,729 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_28618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28618~0; {22444#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:53,730 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:55:53,730 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:55:53,730 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:55:53,731 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:55:53,731 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:55:53,731 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:55:53,732 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:55:53,732 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:55:53,732 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:55:53,733 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:55:53,733 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:55:53,734 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:55:53,734 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:55:53,735 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:55:53,737 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:55:53,738 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:55:53,738 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:55:53,738 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:55:53,739 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:55:53,739 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:55:53,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:55:53,740 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:55:53,744 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:55:53,744 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:55:53,744 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:55:53,745 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:55:53,745 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:55:53,746 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:55:53,746 INFO L290 TraceCheckUtils]: 80: Hoare triple {22443#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {22443#false} is VALID [2022-02-20 18:55:53,746 INFO L290 TraceCheckUtils]: 81: Hoare triple {22443#false} ~mode6~0 := 0; {22443#false} is VALID [2022-02-20 18:55:53,746 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:55:53,746 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:55:53,746 INFO L290 TraceCheckUtils]: 84: Hoare triple {22443#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {22443#false} is VALID [2022-02-20 18:55:53,746 INFO L290 TraceCheckUtils]: 85: Hoare triple {22443#false} ~mode7~0 := 0; {22443#false} is VALID [2022-02-20 18:55:53,746 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:55:53,746 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:55:53,747 INFO L290 TraceCheckUtils]: 88: Hoare triple {22443#false} ~__return_28770~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28770~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:55:53,747 INFO L290 TraceCheckUtils]: 89: Hoare triple {22443#false} assume 0 == main_~assert__arg~0#1 % 256; {22443#false} is VALID [2022-02-20 18:55:53,747 INFO L290 TraceCheckUtils]: 90: Hoare triple {22443#false} assume !false; {22443#false} is VALID [2022-02-20 18:55:53,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:55:53,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:53,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048580628] [2022-02-20 18:55:53,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048580628] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:53,748 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:53,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:53,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178947786] [2022-02-20 18:55:53,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:53,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:55:53,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:53,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:55:53,806 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:55:53,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:53,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:53,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:53,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:53,808 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:55:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:55,151 INFO L93 Difference]: Finished difference Result 5371 states and 8376 transitions. [2022-02-20 18:55:55,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:55,151 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:55:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:55,152 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:55:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:55,153 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:55:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:55:55,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:55:55,403 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:55:55,908 INFO L225 Difference]: With dead ends: 5371 [2022-02-20 18:55:55,909 INFO L226 Difference]: Without dead ends: 3513 [2022-02-20 18:55:55,911 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:55:55,912 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:55:55,913 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:55:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2022-02-20 18:55:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3511. [2022-02-20 18:55:56,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:56,045 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:55:56,051 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:55:56,057 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:55:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:56,402 INFO L93 Difference]: Finished difference Result 3513 states and 5431 transitions. [2022-02-20 18:55:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5431 transitions. [2022-02-20 18:55:56,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:56,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:56,412 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:55:56,417 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:55:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:56,752 INFO L93 Difference]: Finished difference Result 3513 states and 5431 transitions. [2022-02-20 18:55:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5431 transitions. [2022-02-20 18:55:56,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:56,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:56,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:56,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:56,762 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:55:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5430 transitions. [2022-02-20 18:55:57,246 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5430 transitions. Word has length 91 [2022-02-20 18:55:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:57,246 INFO L470 AbstractCegarLoop]: Abstraction has 3511 states and 5430 transitions. [2022-02-20 18:55:57,247 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:55:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5430 transitions. [2022-02-20 18:55:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:55:57,247 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:57,247 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:55:57,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:55:57,248 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash 307326139, now seen corresponding path program 1 times [2022-02-20 18:55:57,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:57,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234794255] [2022-02-20 18:55:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:57,327 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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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_28618~0 := 0;~__return_28770~0 := 0;~__return_28875~0 := 0; {41923#true} is VALID [2022-02-20 18:55:57,328 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:55:57,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {41923#true} assume 0 == ~r1~0; {41923#true} is VALID [2022-02-20 18:55:57,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {41923#true} assume ~id1~0 >= 0; {41923#true} is VALID [2022-02-20 18:55:57,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {41923#true} assume 0 == ~st1~0; {41923#true} is VALID [2022-02-20 18:55:57,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {41923#true} assume ~send1~0 == ~id1~0; {41923#true} is VALID [2022-02-20 18:55:57,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {41923#true} assume 0 == ~mode1~0 % 256; {41923#true} is VALID [2022-02-20 18:55:57,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {41923#true} assume ~id2~0 >= 0; {41923#true} is VALID [2022-02-20 18:55:57,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {41923#true} assume 0 == ~st2~0; {41923#true} is VALID [2022-02-20 18:55:57,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {41923#true} assume ~send2~0 == ~id2~0; {41923#true} is VALID [2022-02-20 18:55:57,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {41923#true} assume 0 == ~mode2~0 % 256; {41923#true} is VALID [2022-02-20 18:55:57,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {41923#true} assume ~id3~0 >= 0; {41923#true} is VALID [2022-02-20 18:55:57,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {41923#true} assume 0 == ~st3~0; {41923#true} is VALID [2022-02-20 18:55:57,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {41923#true} assume ~send3~0 == ~id3~0; {41923#true} is VALID [2022-02-20 18:55:57,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {41923#true} assume 0 == ~mode3~0 % 256; {41923#true} is VALID [2022-02-20 18:55:57,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {41923#true} assume ~id4~0 >= 0; {41923#true} is VALID [2022-02-20 18:55:57,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {41923#true} assume 0 == ~st4~0; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {41923#true} assume ~send4~0 == ~id4~0; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {41923#true} assume 0 == ~mode4~0 % 256; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {41923#true} assume ~id5~0 >= 0; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {41923#true} assume 0 == ~st5~0; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {41923#true} assume ~send5~0 == ~id5~0; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {41923#true} assume 0 == ~mode5~0 % 256; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {41923#true} assume ~id6~0 >= 0; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {41923#true} assume 0 == ~st6~0; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {41923#true} assume ~send6~0 == ~id6~0; {41923#true} is VALID [2022-02-20 18:55:57,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {41923#true} assume 0 == ~mode6~0 % 256; {41923#true} is VALID [2022-02-20 18:55:57,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {41923#true} assume ~id7~0 >= 0; {41923#true} is VALID [2022-02-20 18:55:57,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {41923#true} assume 0 == ~st7~0; {41923#true} is VALID [2022-02-20 18:55:57,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {41923#true} assume ~send7~0 == ~id7~0; {41923#true} is VALID [2022-02-20 18:55:57,331 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:55:57,332 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:55:57,332 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:55:57,332 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:55:57,333 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:55:57,333 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:55:57,333 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:55:57,334 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:55:57,334 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:55:57,334 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:55:57,334 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:55:57,335 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:55:57,335 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:55:57,335 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:55:57,336 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:55:57,336 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:55:57,336 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:55:57,337 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:55:57,337 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:55:57,337 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:55:57,337 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:55:57,338 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_28618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28618~0; {41925#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:55:57,338 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:55:57,339 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:55:57,339 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:55:57,339 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:55:57,340 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:55:57,340 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:55:57,340 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:55:57,340 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:55:57,341 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:55:57,341 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:55:57,341 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:55:57,342 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:55:57,342 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:55:57,342 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:55:57,343 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:55:57,343 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:55:57,343 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:55:57,344 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:55:57,344 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:55:57,344 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:55:57,345 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:55:57,345 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:55:57,345 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:55:57,346 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:55:57,346 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:55:57,346 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:55:57,347 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:55:57,347 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:55:57,347 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:55:57,348 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:55:57,349 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:55:57,349 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:55:57,349 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:55:57,350 INFO L290 TraceCheckUtils]: 85: Hoare triple {41924#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {41924#false} is VALID [2022-02-20 18:55:57,350 INFO L290 TraceCheckUtils]: 86: Hoare triple {41924#false} ~mode7~0 := 0; {41924#false} is VALID [2022-02-20 18:55:57,350 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:55:57,350 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:55:57,350 INFO L290 TraceCheckUtils]: 89: Hoare triple {41924#false} ~__return_28770~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28770~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:55:57,350 INFO L290 TraceCheckUtils]: 90: Hoare triple {41924#false} assume 0 == main_~assert__arg~0#1 % 256; {41924#false} is VALID [2022-02-20 18:55:57,350 INFO L290 TraceCheckUtils]: 91: Hoare triple {41924#false} assume !false; {41924#false} is VALID [2022-02-20 18:55:57,351 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:55:57,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:57,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234794255] [2022-02-20 18:55:57,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234794255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:57,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:57,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:57,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515219754] [2022-02-20 18:55:57,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:57,352 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:55:57,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:57,352 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:55:57,400 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:55:57,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:57,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:57,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:57,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:57,401 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:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:01,392 INFO L93 Difference]: Finished difference Result 9915 states and 15352 transitions. [2022-02-20 18:56:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:01,393 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:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:01,393 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:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:01,395 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:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-02-20 18:56:01,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 421 transitions. [2022-02-20 18:56:01,655 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:03,223 INFO L225 Difference]: With dead ends: 9915 [2022-02-20 18:56:03,223 INFO L226 Difference]: Without dead ends: 6457 [2022-02-20 18:56:03,227 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:03,227 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:03,228 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:03,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2022-02-20 18:56:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 6455. [2022-02-20 18:56:03,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:03,455 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:03,465 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:03,473 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:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:04,593 INFO L93 Difference]: Finished difference Result 6457 states and 9911 transitions. [2022-02-20 18:56:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6457 states and 9911 transitions. [2022-02-20 18:56:04,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:04,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:04,609 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:04,616 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:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:05,726 INFO L93 Difference]: Finished difference Result 6457 states and 9911 transitions. [2022-02-20 18:56:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6457 states and 9911 transitions. [2022-02-20 18:56:05,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:05,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:05,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:05,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:05,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:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6455 states to 6455 states and 9910 transitions. [2022-02-20 18:56:07,396 INFO L78 Accepts]: Start accepts. Automaton has 6455 states and 9910 transitions. Word has length 92 [2022-02-20 18:56:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:07,396 INFO L470 AbstractCegarLoop]: Abstraction has 6455 states and 9910 transitions. [2022-02-20 18:56:07,397 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:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6455 states and 9910 transitions. [2022-02-20 18:56:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 18:56:07,397 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:07,397 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:07,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:56:07,398 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash -450885343, now seen corresponding path program 1 times [2022-02-20 18:56:07,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:07,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655246252] [2022-02-20 18:56:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:07,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:07,502 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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~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_28618~0 := 0;~__return_28770~0 := 0;~__return_28875~0 := 0; {77868#true} is VALID [2022-02-20 18:56:07,502 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:07,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {77868#true} assume 0 == ~r1~0; {77868#true} is VALID [2022-02-20 18:56:07,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {77868#true} assume ~id1~0 >= 0; {77868#true} is VALID [2022-02-20 18:56:07,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {77868#true} assume 0 == ~st1~0; {77870#(<= ~st1~0 0)} is VALID [2022-02-20 18:56:07,503 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:07,504 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:07,504 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:07,504 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:07,505 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:07,505 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:07,505 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:07,505 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:07,506 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:07,506 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:07,506 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:07,507 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:07,507 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:07,507 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:07,508 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:07,508 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:07,508 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:07,509 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:07,509 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:07,509 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:07,510 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:07,510 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:07,510 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:07,511 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:07,511 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:07,511 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:07,512 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:07,512 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:07,512 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:07,513 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:07,513 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:07,513 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:07,514 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:07,514 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:07,514 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:07,515 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:07,515 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:07,515 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:07,516 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:07,516 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:07,516 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:07,517 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:07,517 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:07,517 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:07,518 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:07,518 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:07,518 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_28618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28618~0; {77876#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:07,519 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:07,519 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:07,519 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:07,520 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:07,520 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:07,520 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:07,523 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:07,523 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:07,523 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:07,524 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:07,524 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:07,524 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:07,525 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:07,525 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:07,525 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:07,526 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:07,526 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:07,526 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:07,527 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:07,527 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:07,527 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:07,527 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:07,528 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:07,528 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:07,528 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:07,529 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:07,529 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:07,529 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:07,530 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:07,531 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:07,531 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:07,531 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:07,532 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:07,532 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:07,532 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:07,550 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:07,553 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:07,554 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:07,554 INFO L290 TraceCheckUtils]: 90: Hoare triple {77869#false} ~__return_28770~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28770~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:07,554 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:07,554 INFO L290 TraceCheckUtils]: 92: Hoare triple {77869#false} assume !false; {77869#false} is VALID [2022-02-20 18:56:07,554 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:07,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:07,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655246252] [2022-02-20 18:56:07,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655246252] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:07,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:07,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:56:07,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543438269] [2022-02-20 18:56:07,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:07,556 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:07,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:07,556 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:07,606 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:07,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:56:07,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:56:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:56:07,608 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)