./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.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.8.1.ufo.UNBOUNDED.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 e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:56:53,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:56:53,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:56:53,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:56:53,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:56:53,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:56:53,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:56:53,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:56:53,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:56:53,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:56:53,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:56:53,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:56:53,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:56:53,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:56:53,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:56:53,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:56:53,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:56:53,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:56:53,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:56:53,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:56:53,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:56:53,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:56:53,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:56:53,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:56:53,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:56:53,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:56:53,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:56:53,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:56:53,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:56:53,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:56:53,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:56:53,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:56:53,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:56:53,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:56:53,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:56:53,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:56:53,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:56:53,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:56:53,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:56:53,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:56:53,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:56:53,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:56:53,266 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:56:53,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:56:53,266 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:56:53,266 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:56:53,267 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:56:53,267 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:56:53,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:56:53,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:56:53,268 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:56:53,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:56:53,269 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:56:53,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:56:53,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:56:53,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:56:53,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:56:53,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:56:53,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:56:53,270 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:56:53,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:56:53,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:56:53,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:56:53,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:56:53,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:56:53,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:56:53,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:56:53,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:56:53,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:56:53,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:56:53,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:56:53,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:56:53,273 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:56:53,273 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:56:53,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:56:53,273 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 -> e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d [2022-02-20 18:56:53,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:56:53,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:56:53,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:56:53,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:56:53,479 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:56:53,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:56:53,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3604c0114/814dee13b4294d3d8b7786dbb9da69df/FLAG57f6b7671 [2022-02-20 18:56:53,920 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:56:53,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:56:53,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3604c0114/814dee13b4294d3d8b7786dbb9da69df/FLAG57f6b7671 [2022-02-20 18:56:54,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3604c0114/814dee13b4294d3d8b7786dbb9da69df [2022-02-20 18:56:54,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:56:54,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:56:54,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:56:54,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:56:54,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:56:54,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133e779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54, skipping insertion in model container [2022-02-20 18:56:54,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:56:54,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:56:54,596 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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2022-02-20 18:56:54,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:56:54,664 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:56:54,701 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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2022-02-20 18:56:54,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:56:54,729 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:56:54,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54 WrapperNode [2022-02-20 18:56:54,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:56:54,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:56:54,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:56:54,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:56:54,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,779 INFO L137 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 657 [2022-02-20 18:56:54,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:56:54,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:56:54,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:56:54,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:56:54,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:56:54,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:56:54,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:56:54,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:56:54,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (1/1) ... [2022-02-20 18:56:54,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:56:54,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:56:54,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:56:54,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:56:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:56:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:56:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:56:54,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:56:54,977 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:56:54,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:56:55,477 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:56:55,482 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:56:55,482 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:56:55,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:56:55 BoogieIcfgContainer [2022-02-20 18:56:55,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:56:55,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:56:55,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:56:55,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:56:55,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:56:54" (1/3) ... [2022-02-20 18:56:55,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2252d17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:56:55, skipping insertion in model container [2022-02-20 18:56:55,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:54" (2/3) ... [2022-02-20 18:56:55,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2252d17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:56:55, skipping insertion in model container [2022-02-20 18:56:55,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:56:55" (3/3) ... [2022-02-20 18:56:55,490 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:56:55,493 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:56:55,494 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:56:55,543 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:56:55,547 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:56:55,547 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:56:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 157 states have (on average 1.7515923566878981) internal successors, (275), 158 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call 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:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 18:56:55,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:55,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,569 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash 521817496, now seen corresponding path program 1 times [2022-02-20 18:56:55,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:55,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997599186] [2022-02-20 18:56:55,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:55,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:55,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#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(50, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~__return_60836~0 := 0;~__return_61007~0 := 0; {162#true} is VALID [2022-02-20 18:56:55,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~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;~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;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {162#true} is VALID [2022-02-20 18:56:55,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume 0 == ~r1~0 % 256; {162#true} is VALID [2022-02-20 18:56:55,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {162#true} assume ~id1~0 >= 0; {162#true} is VALID [2022-02-20 18:56:55,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#true} assume 0 == ~st1~0; {162#true} is VALID [2022-02-20 18:56:55,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} assume ~send1~0 == ~id1~0; {162#true} is VALID [2022-02-20 18:56:55,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#true} assume 0 == ~mode1~0 % 256; {162#true} is VALID [2022-02-20 18:56:55,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#true} assume ~id2~0 >= 0; {162#true} is VALID [2022-02-20 18:56:55,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#true} assume 0 == ~st2~0; {162#true} is VALID [2022-02-20 18:56:55,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {162#true} assume ~send2~0 == ~id2~0; {162#true} is VALID [2022-02-20 18:56:55,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#true} assume 0 == ~mode2~0 % 256; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,863 INFO L290 TraceCheckUtils]: 35: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,868 INFO L290 TraceCheckUtils]: 45: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,872 INFO L290 TraceCheckUtils]: 55: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,875 INFO L290 TraceCheckUtils]: 60: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,876 INFO L290 TraceCheckUtils]: 62: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_60836~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_60836~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {164#(= (+ (* (- 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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,879 INFO L290 TraceCheckUtils]: 65: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,880 INFO L290 TraceCheckUtils]: 66: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0); {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,880 INFO L290 TraceCheckUtils]: 67: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {164#(= (+ (* (- 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; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,881 INFO L290 TraceCheckUtils]: 69: Hoare triple {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {164#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:55,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {164#(= (+ (* (- 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; {163#false} is VALID [2022-02-20 18:56:55,882 INFO L290 TraceCheckUtils]: 71: Hoare triple {163#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {163#false} is VALID [2022-02-20 18:56:55,882 INFO L290 TraceCheckUtils]: 72: Hoare triple {163#false} ~mode2~0 := 0; {163#false} is VALID [2022-02-20 18:56:55,882 INFO L290 TraceCheckUtils]: 73: Hoare triple {163#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,883 INFO L290 TraceCheckUtils]: 74: Hoare triple {163#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,883 INFO L290 TraceCheckUtils]: 75: Hoare triple {163#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {163#false} is VALID [2022-02-20 18:56:55,883 INFO L290 TraceCheckUtils]: 76: Hoare triple {163#false} ~mode3~0 := 0; {163#false} is VALID [2022-02-20 18:56:55,883 INFO L290 TraceCheckUtils]: 77: Hoare triple {163#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,884 INFO L290 TraceCheckUtils]: 78: Hoare triple {163#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,884 INFO L290 TraceCheckUtils]: 79: Hoare triple {163#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {163#false} is VALID [2022-02-20 18:56:55,886 INFO L290 TraceCheckUtils]: 80: Hoare triple {163#false} ~mode4~0 := 0; {163#false} is VALID [2022-02-20 18:56:55,887 INFO L290 TraceCheckUtils]: 81: Hoare triple {163#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,887 INFO L290 TraceCheckUtils]: 82: Hoare triple {163#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,887 INFO L290 TraceCheckUtils]: 83: Hoare triple {163#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {163#false} is VALID [2022-02-20 18:56:55,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {163#false} ~mode5~0 := 0; {163#false} is VALID [2022-02-20 18:56:55,888 INFO L290 TraceCheckUtils]: 85: Hoare triple {163#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,888 INFO L290 TraceCheckUtils]: 86: Hoare triple {163#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,888 INFO L290 TraceCheckUtils]: 87: Hoare triple {163#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {163#false} is VALID [2022-02-20 18:56:55,889 INFO L290 TraceCheckUtils]: 88: Hoare triple {163#false} ~mode6~0 := 0; {163#false} is VALID [2022-02-20 18:56:55,892 INFO L290 TraceCheckUtils]: 89: Hoare triple {163#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,892 INFO L290 TraceCheckUtils]: 90: Hoare triple {163#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,893 INFO L290 TraceCheckUtils]: 91: Hoare triple {163#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {163#false} is VALID [2022-02-20 18:56:55,893 INFO L290 TraceCheckUtils]: 92: Hoare triple {163#false} ~mode7~0 := 0; {163#false} is VALID [2022-02-20 18:56:55,894 INFO L290 TraceCheckUtils]: 93: Hoare triple {163#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,894 INFO L290 TraceCheckUtils]: 94: Hoare triple {163#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {163#false} is VALID [2022-02-20 18:56:55,894 INFO L290 TraceCheckUtils]: 95: Hoare triple {163#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {163#false} is VALID [2022-02-20 18:56:55,894 INFO L290 TraceCheckUtils]: 96: Hoare triple {163#false} ~mode8~0 := 0; {163#false} is VALID [2022-02-20 18:56:55,894 INFO L290 TraceCheckUtils]: 97: Hoare triple {163#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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {163#false} is VALID [2022-02-20 18:56:55,895 INFO L290 TraceCheckUtils]: 98: Hoare triple {163#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {163#false} is VALID [2022-02-20 18:56:55,895 INFO L290 TraceCheckUtils]: 99: Hoare triple {163#false} ~__return_61007~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61007~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; {163#false} is VALID [2022-02-20 18:56:55,895 INFO L290 TraceCheckUtils]: 100: Hoare triple {163#false} assume 0 == main_~assert__arg~0#1 % 256; {163#false} is VALID [2022-02-20 18:56:55,895 INFO L290 TraceCheckUtils]: 101: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-02-20 18:56:55,898 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:55,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:55,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997599186] [2022-02-20 18:56:55,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997599186] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:55,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:55,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:55,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331846062] [2022-02-20 18:56:55,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:56:55,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:55,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:56,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:56,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:56,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:56,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:56,052 INFO L87 Difference]: Start difference. First operand has 159 states, 157 states have (on average 1.7515923566878981) internal successors, (275), 158 states have internal predecessors, (275), 0 states have call successors, (0), 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 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:56,473 INFO L93 Difference]: Finished difference Result 341 states and 560 transitions. [2022-02-20 18:56:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:56,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:56:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2022-02-20 18:56:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2022-02-20 18:56:56,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 560 transitions. [2022-02-20 18:56:56,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:56,896 INFO L225 Difference]: With dead ends: 341 [2022-02-20 18:56:56,896 INFO L226 Difference]: Without dead ends: 240 [2022-02-20 18:56:56,898 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:56,901 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 186 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:56,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 541 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-02-20 18:56:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-02-20 18:56:56,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:56,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 238 states, 237 states have (on average 1.4388185654008439) internal successors, (341), 237 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call 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:56,932 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 238 states, 237 states have (on average 1.4388185654008439) internal successors, (341), 237 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call 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:56,934 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 238 states, 237 states have (on average 1.4388185654008439) internal successors, (341), 237 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call 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:56,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:56,947 INFO L93 Difference]: Finished difference Result 240 states and 342 transitions. [2022-02-20 18:56:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 342 transitions. [2022-02-20 18:56:56,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:56,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:56,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 237 states have (on average 1.4388185654008439) internal successors, (341), 237 states have internal predecessors, (341), 0 states have call successors, (0), 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 240 states. [2022-02-20 18:56:56,949 INFO L87 Difference]: Start difference. First operand has 238 states, 237 states have (on average 1.4388185654008439) internal successors, (341), 237 states have internal predecessors, (341), 0 states have call successors, (0), 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 240 states. [2022-02-20 18:56:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:56,956 INFO L93 Difference]: Finished difference Result 240 states and 342 transitions. [2022-02-20 18:56:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 342 transitions. [2022-02-20 18:56:56,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:56,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:56,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:56,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.4388185654008439) internal successors, (341), 237 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call 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:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 341 transitions. [2022-02-20 18:56:56,966 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 341 transitions. Word has length 102 [2022-02-20 18:56:56,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:56,966 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 341 transitions. [2022-02-20 18:56:56,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 341 transitions. [2022-02-20 18:56:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-20 18:56:56,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:56,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:56,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:56:56,969 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1097817700, now seen corresponding path program 1 times [2022-02-20 18:56:56,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:56,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591493066] [2022-02-20 18:56:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:57,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {1403#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(50, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~__return_60836~0 := 0;~__return_61007~0 := 0; {1403#true} is VALID [2022-02-20 18:56:57,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {1403#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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~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;~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;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {1403#true} is VALID [2022-02-20 18:56:57,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {1403#true} assume 0 == ~r1~0 % 256; {1403#true} is VALID [2022-02-20 18:56:57,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {1403#true} assume ~id1~0 >= 0; {1403#true} is VALID [2022-02-20 18:56:57,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {1403#true} assume 0 == ~st1~0; {1403#true} is VALID [2022-02-20 18:56:57,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {1403#true} assume ~send1~0 == ~id1~0; {1403#true} is VALID [2022-02-20 18:56:57,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {1403#true} assume 0 == ~mode1~0 % 256; {1403#true} is VALID [2022-02-20 18:56:57,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {1403#true} assume ~id2~0 >= 0; {1403#true} is VALID [2022-02-20 18:56:57,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {1403#true} assume 0 == ~st2~0; {1403#true} is VALID [2022-02-20 18:56:57,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {1403#true} assume ~send2~0 == ~id2~0; {1403#true} is VALID [2022-02-20 18:56:57,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {1403#true} assume 0 == ~mode2~0 % 256; {1403#true} is VALID [2022-02-20 18:56:57,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {1403#true} assume ~id3~0 >= 0; {1403#true} is VALID [2022-02-20 18:56:57,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {1403#true} assume 0 == ~st3~0; {1403#true} is VALID [2022-02-20 18:56:57,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {1403#true} assume ~send3~0 == ~id3~0; {1403#true} is VALID [2022-02-20 18:56:57,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {1403#true} assume 0 == ~mode3~0 % 256; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_60836~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_60836~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {1405#(= (+ (* (- 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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,170 INFO L290 TraceCheckUtils]: 64: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0); {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,171 INFO L290 TraceCheckUtils]: 67: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {1405#(= (+ (* (- 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; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,173 INFO L290 TraceCheckUtils]: 71: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,174 INFO L290 TraceCheckUtils]: 73: Hoare triple {1405#(= (+ (* (- 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; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,174 INFO L290 TraceCheckUtils]: 74: Hoare triple {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1405#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:57,175 INFO L290 TraceCheckUtils]: 75: Hoare triple {1405#(= (+ (* (- 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; {1404#false} is VALID [2022-02-20 18:56:57,175 INFO L290 TraceCheckUtils]: 76: Hoare triple {1404#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1404#false} is VALID [2022-02-20 18:56:57,176 INFO L290 TraceCheckUtils]: 77: Hoare triple {1404#false} ~mode3~0 := 0; {1404#false} is VALID [2022-02-20 18:56:57,176 INFO L290 TraceCheckUtils]: 78: Hoare triple {1404#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,176 INFO L290 TraceCheckUtils]: 79: Hoare triple {1404#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,176 INFO L290 TraceCheckUtils]: 80: Hoare triple {1404#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1404#false} is VALID [2022-02-20 18:56:57,176 INFO L290 TraceCheckUtils]: 81: Hoare triple {1404#false} ~mode4~0 := 0; {1404#false} is VALID [2022-02-20 18:56:57,176 INFO L290 TraceCheckUtils]: 82: Hoare triple {1404#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,176 INFO L290 TraceCheckUtils]: 83: Hoare triple {1404#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {1404#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1404#false} is VALID [2022-02-20 18:56:57,177 INFO L290 TraceCheckUtils]: 85: Hoare triple {1404#false} ~mode5~0 := 0; {1404#false} is VALID [2022-02-20 18:56:57,177 INFO L290 TraceCheckUtils]: 86: Hoare triple {1404#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,177 INFO L290 TraceCheckUtils]: 87: Hoare triple {1404#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,178 INFO L290 TraceCheckUtils]: 88: Hoare triple {1404#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1404#false} is VALID [2022-02-20 18:56:57,178 INFO L290 TraceCheckUtils]: 89: Hoare triple {1404#false} ~mode6~0 := 0; {1404#false} is VALID [2022-02-20 18:56:57,178 INFO L290 TraceCheckUtils]: 90: Hoare triple {1404#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,178 INFO L290 TraceCheckUtils]: 91: Hoare triple {1404#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,179 INFO L290 TraceCheckUtils]: 92: Hoare triple {1404#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {1404#false} is VALID [2022-02-20 18:56:57,179 INFO L290 TraceCheckUtils]: 93: Hoare triple {1404#false} ~mode7~0 := 0; {1404#false} is VALID [2022-02-20 18:56:57,179 INFO L290 TraceCheckUtils]: 94: Hoare triple {1404#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,179 INFO L290 TraceCheckUtils]: 95: Hoare triple {1404#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {1404#false} is VALID [2022-02-20 18:56:57,179 INFO L290 TraceCheckUtils]: 96: Hoare triple {1404#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {1404#false} is VALID [2022-02-20 18:56:57,179 INFO L290 TraceCheckUtils]: 97: Hoare triple {1404#false} ~mode8~0 := 0; {1404#false} is VALID [2022-02-20 18:56:57,179 INFO L290 TraceCheckUtils]: 98: Hoare triple {1404#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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1404#false} is VALID [2022-02-20 18:56:57,180 INFO L290 TraceCheckUtils]: 99: Hoare triple {1404#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {1404#false} is VALID [2022-02-20 18:56:57,180 INFO L290 TraceCheckUtils]: 100: Hoare triple {1404#false} ~__return_61007~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61007~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; {1404#false} is VALID [2022-02-20 18:56:57,180 INFO L290 TraceCheckUtils]: 101: Hoare triple {1404#false} assume 0 == main_~assert__arg~0#1 % 256; {1404#false} is VALID [2022-02-20 18:56:57,182 INFO L290 TraceCheckUtils]: 102: Hoare triple {1404#false} assume !false; {1404#false} is VALID [2022-02-20 18:56:57,183 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:57,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:57,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591493066] [2022-02-20 18:56:57,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591493066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:57,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:57,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:57,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753716053] [2022-02-20 18:56:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:57,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-02-20 18:56:57,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:57,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:57,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:57,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:57,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:57,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:57,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:57,259 INFO L87 Difference]: Start difference. First operand 238 states and 341 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:57,514 INFO L93 Difference]: Finished difference Result 570 states and 869 transitions. [2022-02-20 18:56:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:57,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-02-20 18:56:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:56:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:56:57,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:56:57,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:57,844 INFO L225 Difference]: With dead ends: 570 [2022-02-20 18:56:57,844 INFO L226 Difference]: Without dead ends: 396 [2022-02-20 18:56:57,845 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:57,846 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 461 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:57,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 461 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:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-02-20 18:56:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2022-02-20 18:56:57,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:57,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 394 states, 393 states have (on average 1.4987277353689568) internal successors, (589), 393 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call 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:57,866 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 394 states, 393 states have (on average 1.4987277353689568) internal successors, (589), 393 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call 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:57,867 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 394 states, 393 states have (on average 1.4987277353689568) internal successors, (589), 393 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call 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:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:57,879 INFO L93 Difference]: Finished difference Result 396 states and 590 transitions. [2022-02-20 18:56:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 590 transitions. [2022-02-20 18:56:57,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:57,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:57,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 394 states, 393 states have (on average 1.4987277353689568) internal successors, (589), 393 states have internal predecessors, (589), 0 states have call successors, (0), 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 396 states. [2022-02-20 18:56:57,882 INFO L87 Difference]: Start difference. First operand has 394 states, 393 states have (on average 1.4987277353689568) internal successors, (589), 393 states have internal predecessors, (589), 0 states have call successors, (0), 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 396 states. [2022-02-20 18:56:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:57,893 INFO L93 Difference]: Finished difference Result 396 states and 590 transitions. [2022-02-20 18:56:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 590 transitions. [2022-02-20 18:56:57,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:57,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:57,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:57,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.4987277353689568) internal successors, (589), 393 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call 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:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 589 transitions. [2022-02-20 18:56:57,908 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 589 transitions. Word has length 103 [2022-02-20 18:56:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:57,909 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 589 transitions. [2022-02-20 18:56:57,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 589 transitions. [2022-02-20 18:56:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 18:56:57,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:57,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:57,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:56:57,913 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:57,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:57,913 INFO L85 PathProgramCache]: Analyzing trace with hash 186284590, now seen corresponding path program 1 times [2022-02-20 18:56:57,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:57,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196879963] [2022-02-20 18:56:57,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:57,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:58,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {3497#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(50, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~__return_60836~0 := 0;~__return_61007~0 := 0; {3497#true} is VALID [2022-02-20 18:56:58,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {3497#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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~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;~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;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {3497#true} is VALID [2022-02-20 18:56:58,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {3497#true} assume 0 == ~r1~0 % 256; {3497#true} is VALID [2022-02-20 18:56:58,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {3497#true} assume ~id1~0 >= 0; {3497#true} is VALID [2022-02-20 18:56:58,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {3497#true} assume 0 == ~st1~0; {3497#true} is VALID [2022-02-20 18:56:58,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {3497#true} assume ~send1~0 == ~id1~0; {3497#true} is VALID [2022-02-20 18:56:58,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {3497#true} assume 0 == ~mode1~0 % 256; {3497#true} is VALID [2022-02-20 18:56:58,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {3497#true} assume ~id2~0 >= 0; {3497#true} is VALID [2022-02-20 18:56:58,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {3497#true} assume 0 == ~st2~0; {3497#true} is VALID [2022-02-20 18:56:58,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {3497#true} assume ~send2~0 == ~id2~0; {3497#true} is VALID [2022-02-20 18:56:58,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {3497#true} assume 0 == ~mode2~0 % 256; {3497#true} is VALID [2022-02-20 18:56:58,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {3497#true} assume ~id3~0 >= 0; {3497#true} is VALID [2022-02-20 18:56:58,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {3497#true} assume 0 == ~st3~0; {3497#true} is VALID [2022-02-20 18:56:58,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {3497#true} assume ~send3~0 == ~id3~0; {3497#true} is VALID [2022-02-20 18:56:58,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {3497#true} assume 0 == ~mode3~0 % 256; {3497#true} is VALID [2022-02-20 18:56:58,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {3497#true} assume ~id4~0 >= 0; {3497#true} is VALID [2022-02-20 18:56:58,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {3497#true} assume 0 == ~st4~0; {3497#true} is VALID [2022-02-20 18:56:58,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {3497#true} assume ~send4~0 == ~id4~0; {3497#true} is VALID [2022-02-20 18:56:58,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {3497#true} assume 0 == ~mode4~0 % 256; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,029 INFO L290 TraceCheckUtils]: 51: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,029 INFO L290 TraceCheckUtils]: 52: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,030 INFO L290 TraceCheckUtils]: 54: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,030 INFO L290 TraceCheckUtils]: 55: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,032 INFO L290 TraceCheckUtils]: 60: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_60836~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_60836~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {3499#(= (+ (* (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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,034 INFO L290 TraceCheckUtils]: 65: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,034 INFO L290 TraceCheckUtils]: 66: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0); {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,035 INFO L290 TraceCheckUtils]: 67: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {3499#(= (+ (* (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; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,035 INFO L290 TraceCheckUtils]: 69: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,036 INFO L290 TraceCheckUtils]: 70: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,041 INFO L290 TraceCheckUtils]: 73: Hoare triple {3499#(= (+ (* (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; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,041 INFO L290 TraceCheckUtils]: 74: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,041 INFO L290 TraceCheckUtils]: 75: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,042 INFO L290 TraceCheckUtils]: 76: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,042 INFO L290 TraceCheckUtils]: 77: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,042 INFO L290 TraceCheckUtils]: 78: Hoare triple {3499#(= (+ (* (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; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,043 INFO L290 TraceCheckUtils]: 79: Hoare triple {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3499#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:58,043 INFO L290 TraceCheckUtils]: 80: Hoare triple {3499#(= (+ (* (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; {3498#false} is VALID [2022-02-20 18:56:58,043 INFO L290 TraceCheckUtils]: 81: Hoare triple {3498#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {3498#false} is VALID [2022-02-20 18:56:58,043 INFO L290 TraceCheckUtils]: 82: Hoare triple {3498#false} ~mode4~0 := 0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 83: Hoare triple {3498#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 84: Hoare triple {3498#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 85: Hoare triple {3498#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 86: Hoare triple {3498#false} ~mode5~0 := 0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 87: Hoare triple {3498#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 88: Hoare triple {3498#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 89: Hoare triple {3498#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 90: Hoare triple {3498#false} ~mode6~0 := 0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 91: Hoare triple {3498#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 92: Hoare triple {3498#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 93: Hoare triple {3498#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 94: Hoare triple {3498#false} ~mode7~0 := 0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 95: Hoare triple {3498#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 96: Hoare triple {3498#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 97: Hoare triple {3498#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {3498#false} is VALID [2022-02-20 18:56:58,044 INFO L290 TraceCheckUtils]: 98: Hoare triple {3498#false} ~mode8~0 := 0; {3498#false} is VALID [2022-02-20 18:56:58,045 INFO L290 TraceCheckUtils]: 99: Hoare triple {3498#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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3498#false} is VALID [2022-02-20 18:56:58,045 INFO L290 TraceCheckUtils]: 100: Hoare triple {3498#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {3498#false} is VALID [2022-02-20 18:56:58,045 INFO L290 TraceCheckUtils]: 101: Hoare triple {3498#false} ~__return_61007~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61007~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; {3498#false} is VALID [2022-02-20 18:56:58,045 INFO L290 TraceCheckUtils]: 102: Hoare triple {3498#false} assume 0 == main_~assert__arg~0#1 % 256; {3498#false} is VALID [2022-02-20 18:56:58,045 INFO L290 TraceCheckUtils]: 103: Hoare triple {3498#false} assume !false; {3498#false} is VALID [2022-02-20 18:56:58,045 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:58,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:58,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196879963] [2022-02-20 18:56:58,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196879963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:58,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:58,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:58,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204820445] [2022-02-20 18:56:58,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:58,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:56:58,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:58,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:58,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:58,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:58,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:58,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:58,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:58,131 INFO L87 Difference]: Start difference. First operand 394 states and 589 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:58,406 INFO L93 Difference]: Finished difference Result 1022 states and 1587 transitions. [2022-02-20 18:56:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:58,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:56:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:56:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:56:58,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:56:58,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:58,736 INFO L225 Difference]: With dead ends: 1022 [2022-02-20 18:56:58,737 INFO L226 Difference]: Without dead ends: 692 [2022-02-20 18:56:58,738 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:58,739 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 121 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 457 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:58,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 457 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:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-02-20 18:56:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2022-02-20 18:56:58,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:58,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 692 states. Second operand has 690 states, 689 states have (on average 1.5341074020319303) internal successors, (1057), 689 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call 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:58,796 INFO L74 IsIncluded]: Start isIncluded. First operand 692 states. Second operand has 690 states, 689 states have (on average 1.5341074020319303) internal successors, (1057), 689 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call 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:58,797 INFO L87 Difference]: Start difference. First operand 692 states. Second operand has 690 states, 689 states have (on average 1.5341074020319303) internal successors, (1057), 689 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call 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:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:58,822 INFO L93 Difference]: Finished difference Result 692 states and 1058 transitions. [2022-02-20 18:56:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1058 transitions. [2022-02-20 18:56:58,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:58,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:58,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 690 states, 689 states have (on average 1.5341074020319303) internal successors, (1057), 689 states have internal predecessors, (1057), 0 states have call successors, (0), 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 692 states. [2022-02-20 18:56:58,826 INFO L87 Difference]: Start difference. First operand has 690 states, 689 states have (on average 1.5341074020319303) internal successors, (1057), 689 states have internal predecessors, (1057), 0 states have call successors, (0), 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 692 states. [2022-02-20 18:56:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:58,843 INFO L93 Difference]: Finished difference Result 692 states and 1058 transitions. [2022-02-20 18:56:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1058 transitions. [2022-02-20 18:56:58,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:58,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:58,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:58,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 1.5341074020319303) internal successors, (1057), 689 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call 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:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1057 transitions. [2022-02-20 18:56:58,867 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1057 transitions. Word has length 104 [2022-02-20 18:56:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:58,868 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 1057 transitions. [2022-02-20 18:56:58,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1057 transitions. [2022-02-20 18:56:58,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:56:58,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:58,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:58,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:56:58,869 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:58,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1107025040, now seen corresponding path program 1 times [2022-02-20 18:56:58,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:58,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635593926] [2022-02-20 18:56:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:58,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {7234#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(50, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~__return_60836~0 := 0;~__return_61007~0 := 0; {7234#true} is VALID [2022-02-20 18:56:58,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {7234#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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~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;~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;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {7234#true} is VALID [2022-02-20 18:56:58,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {7234#true} assume 0 == ~r1~0 % 256; {7234#true} is VALID [2022-02-20 18:56:58,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {7234#true} assume ~id1~0 >= 0; {7234#true} is VALID [2022-02-20 18:56:58,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {7234#true} assume 0 == ~st1~0; {7234#true} is VALID [2022-02-20 18:56:58,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {7234#true} assume ~send1~0 == ~id1~0; {7234#true} is VALID [2022-02-20 18:56:58,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {7234#true} assume 0 == ~mode1~0 % 256; {7234#true} is VALID [2022-02-20 18:56:58,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {7234#true} assume ~id2~0 >= 0; {7234#true} is VALID [2022-02-20 18:56:58,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {7234#true} assume 0 == ~st2~0; {7234#true} is VALID [2022-02-20 18:56:58,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {7234#true} assume ~send2~0 == ~id2~0; {7234#true} is VALID [2022-02-20 18:56:58,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {7234#true} assume 0 == ~mode2~0 % 256; {7234#true} is VALID [2022-02-20 18:56:58,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {7234#true} assume ~id3~0 >= 0; {7234#true} is VALID [2022-02-20 18:56:58,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {7234#true} assume 0 == ~st3~0; {7234#true} is VALID [2022-02-20 18:56:58,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {7234#true} assume ~send3~0 == ~id3~0; {7234#true} is VALID [2022-02-20 18:56:58,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {7234#true} assume 0 == ~mode3~0 % 256; {7234#true} is VALID [2022-02-20 18:56:58,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {7234#true} assume ~id4~0 >= 0; {7234#true} is VALID [2022-02-20 18:56:58,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {7234#true} assume 0 == ~st4~0; {7234#true} is VALID [2022-02-20 18:56:58,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {7234#true} assume ~send4~0 == ~id4~0; {7234#true} is VALID [2022-02-20 18:56:58,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {7234#true} assume 0 == ~mode4~0 % 256; {7234#true} is VALID [2022-02-20 18:56:58,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {7234#true} assume ~id5~0 >= 0; {7234#true} is VALID [2022-02-20 18:56:58,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {7234#true} assume 0 == ~st5~0; {7234#true} is VALID [2022-02-20 18:56:58,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {7234#true} assume ~send5~0 == ~id5~0; {7234#true} is VALID [2022-02-20 18:56:58,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {7234#true} assume 0 == ~mode5~0 % 256; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,969 INFO L290 TraceCheckUtils]: 44: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,973 INFO L290 TraceCheckUtils]: 56: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_60836~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_60836~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {7236#(= (+ (* (- 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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0); {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,977 INFO L290 TraceCheckUtils]: 67: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {7236#(= (+ (* (- 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; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,982 INFO L290 TraceCheckUtils]: 69: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,987 INFO L290 TraceCheckUtils]: 70: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,989 INFO L290 TraceCheckUtils]: 72: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,989 INFO L290 TraceCheckUtils]: 73: Hoare triple {7236#(= (+ (* (- 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; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,990 INFO L290 TraceCheckUtils]: 74: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,990 INFO L290 TraceCheckUtils]: 75: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,991 INFO L290 TraceCheckUtils]: 76: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0); {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,991 INFO L290 TraceCheckUtils]: 77: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,991 INFO L290 TraceCheckUtils]: 78: Hoare triple {7236#(= (+ (* (- 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; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,992 INFO L290 TraceCheckUtils]: 79: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,992 INFO L290 TraceCheckUtils]: 80: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,992 INFO L290 TraceCheckUtils]: 81: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,993 INFO L290 TraceCheckUtils]: 82: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,993 INFO L290 TraceCheckUtils]: 83: Hoare triple {7236#(= (+ (* (- 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; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,993 INFO L290 TraceCheckUtils]: 84: Hoare triple {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {7236#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:58,994 INFO L290 TraceCheckUtils]: 85: Hoare triple {7236#(= (+ (* (- 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; {7235#false} is VALID [2022-02-20 18:56:58,994 INFO L290 TraceCheckUtils]: 86: Hoare triple {7235#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {7235#false} is VALID [2022-02-20 18:56:58,994 INFO L290 TraceCheckUtils]: 87: Hoare triple {7235#false} ~mode5~0 := 0; {7235#false} is VALID [2022-02-20 18:56:58,994 INFO L290 TraceCheckUtils]: 88: Hoare triple {7235#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {7235#false} is VALID [2022-02-20 18:56:58,994 INFO L290 TraceCheckUtils]: 89: Hoare triple {7235#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {7235#false} is VALID [2022-02-20 18:56:58,994 INFO L290 TraceCheckUtils]: 90: Hoare triple {7235#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {7235#false} is VALID [2022-02-20 18:56:58,994 INFO L290 TraceCheckUtils]: 91: Hoare triple {7235#false} ~mode6~0 := 0; {7235#false} is VALID [2022-02-20 18:56:58,994 INFO L290 TraceCheckUtils]: 92: Hoare triple {7235#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {7235#false} is VALID [2022-02-20 18:56:58,995 INFO L290 TraceCheckUtils]: 93: Hoare triple {7235#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {7235#false} is VALID [2022-02-20 18:56:58,995 INFO L290 TraceCheckUtils]: 94: Hoare triple {7235#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {7235#false} is VALID [2022-02-20 18:56:58,995 INFO L290 TraceCheckUtils]: 95: Hoare triple {7235#false} ~mode7~0 := 0; {7235#false} is VALID [2022-02-20 18:56:58,995 INFO L290 TraceCheckUtils]: 96: Hoare triple {7235#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {7235#false} is VALID [2022-02-20 18:56:58,995 INFO L290 TraceCheckUtils]: 97: Hoare triple {7235#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {7235#false} is VALID [2022-02-20 18:56:58,995 INFO L290 TraceCheckUtils]: 98: Hoare triple {7235#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {7235#false} is VALID [2022-02-20 18:56:58,995 INFO L290 TraceCheckUtils]: 99: Hoare triple {7235#false} ~mode8~0 := 0; {7235#false} is VALID [2022-02-20 18:56:58,995 INFO L290 TraceCheckUtils]: 100: Hoare triple {7235#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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7235#false} is VALID [2022-02-20 18:56:58,995 INFO L290 TraceCheckUtils]: 101: Hoare triple {7235#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {7235#false} is VALID [2022-02-20 18:56:58,996 INFO L290 TraceCheckUtils]: 102: Hoare triple {7235#false} ~__return_61007~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61007~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; {7235#false} is VALID [2022-02-20 18:56:58,996 INFO L290 TraceCheckUtils]: 103: Hoare triple {7235#false} assume 0 == main_~assert__arg~0#1 % 256; {7235#false} is VALID [2022-02-20 18:56:58,996 INFO L290 TraceCheckUtils]: 104: Hoare triple {7235#false} assume !false; {7235#false} is VALID [2022-02-20 18:56:58,997 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:58,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:58,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635593926] [2022-02-20 18:56:58,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635593926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:58,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:58,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:58,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59403244] [2022-02-20 18:56:58,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:56:58,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:58,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:59,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:59,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:59,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:59,060 INFO L87 Difference]: Start difference. First operand 690 states and 1057 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:59,469 INFO L93 Difference]: Finished difference Result 1878 states and 2939 transitions. [2022-02-20 18:56:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:59,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:56:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:56:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:56:59,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:56:59,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:59,850 INFO L225 Difference]: With dead ends: 1878 [2022-02-20 18:56:59,851 INFO L226 Difference]: Without dead ends: 1252 [2022-02-20 18:56:59,852 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:59,853 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 116 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 453 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:59,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 453 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:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-02-20 18:56:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2022-02-20 18:56:59,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:59,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1252 states. Second operand has 1250 states, 1249 states have (on average 1.5508406725380304) internal successors, (1937), 1249 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call 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:59,895 INFO L74 IsIncluded]: Start isIncluded. First operand 1252 states. Second operand has 1250 states, 1249 states have (on average 1.5508406725380304) internal successors, (1937), 1249 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call 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:59,897 INFO L87 Difference]: Start difference. First operand 1252 states. Second operand has 1250 states, 1249 states have (on average 1.5508406725380304) internal successors, (1937), 1249 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call 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:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:59,945 INFO L93 Difference]: Finished difference Result 1252 states and 1938 transitions. [2022-02-20 18:56:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1938 transitions. [2022-02-20 18:56:59,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:59,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:59,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 1250 states, 1249 states have (on average 1.5508406725380304) internal successors, (1937), 1249 states have internal predecessors, (1937), 0 states have call successors, (0), 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 1252 states. [2022-02-20 18:56:59,951 INFO L87 Difference]: Start difference. First operand has 1250 states, 1249 states have (on average 1.5508406725380304) internal successors, (1937), 1249 states have internal predecessors, (1937), 0 states have call successors, (0), 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 1252 states. [2022-02-20 18:57:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:00,000 INFO L93 Difference]: Finished difference Result 1252 states and 1938 transitions. [2022-02-20 18:57:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1938 transitions. [2022-02-20 18:57:00,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:00,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:00,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:00,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.5508406725380304) internal successors, (1937), 1249 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1937 transitions. [2022-02-20 18:57:00,081 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1937 transitions. Word has length 105 [2022-02-20 18:57:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:00,082 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 1937 transitions. [2022-02-20 18:57:00,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1937 transitions. [2022-02-20 18:57:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 18:57:00,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:00,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:00,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:57:00,083 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1750887068, now seen corresponding path program 1 times [2022-02-20 18:57:00,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:00,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120942064] [2022-02-20 18:57:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:00,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:00,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {14083#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(50, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~__return_60836~0 := 0;~__return_61007~0 := 0; {14083#true} is VALID [2022-02-20 18:57:00,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {14083#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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~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;~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;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {14083#true} assume 0 == ~r1~0 % 256; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {14083#true} assume ~id1~0 >= 0; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {14083#true} assume 0 == ~st1~0; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {14083#true} assume ~send1~0 == ~id1~0; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {14083#true} assume 0 == ~mode1~0 % 256; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {14083#true} assume ~id2~0 >= 0; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {14083#true} assume 0 == ~st2~0; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {14083#true} assume ~send2~0 == ~id2~0; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {14083#true} assume 0 == ~mode2~0 % 256; {14083#true} is VALID [2022-02-20 18:57:00,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {14083#true} assume ~id3~0 >= 0; {14083#true} is VALID [2022-02-20 18:57:00,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {14083#true} assume 0 == ~st3~0; {14083#true} is VALID [2022-02-20 18:57:00,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {14083#true} assume ~send3~0 == ~id3~0; {14083#true} is VALID [2022-02-20 18:57:00,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {14083#true} assume 0 == ~mode3~0 % 256; {14083#true} is VALID [2022-02-20 18:57:00,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {14083#true} assume ~id4~0 >= 0; {14083#true} is VALID [2022-02-20 18:57:00,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {14083#true} assume 0 == ~st4~0; {14083#true} is VALID [2022-02-20 18:57:00,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {14083#true} assume ~send4~0 == ~id4~0; {14083#true} is VALID [2022-02-20 18:57:00,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {14083#true} assume 0 == ~mode4~0 % 256; {14083#true} is VALID [2022-02-20 18:57:00,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {14083#true} assume ~id5~0 >= 0; {14083#true} is VALID [2022-02-20 18:57:00,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {14083#true} assume 0 == ~st5~0; {14083#true} is VALID [2022-02-20 18:57:00,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {14083#true} assume ~send5~0 == ~id5~0; {14083#true} is VALID [2022-02-20 18:57:00,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {14083#true} assume 0 == ~mode5~0 % 256; {14083#true} is VALID [2022-02-20 18:57:00,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {14083#true} assume ~id6~0 >= 0; {14083#true} is VALID [2022-02-20 18:57:00,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {14083#true} assume 0 == ~st6~0; {14083#true} is VALID [2022-02-20 18:57:00,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {14083#true} assume ~send6~0 == ~id6~0; {14083#true} is VALID [2022-02-20 18:57:00,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {14083#true} assume 0 == ~mode6~0 % 256; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id8~0 >= 0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st8~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send8~0 == ~id8~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode8~0 % 256; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id8~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id8~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id8~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id8~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id8~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id8~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_60836~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_60836~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,185 INFO L290 TraceCheckUtils]: 63: Hoare triple {14085#(= (+ (* (- 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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,186 INFO L290 TraceCheckUtils]: 65: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,186 INFO L290 TraceCheckUtils]: 66: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~nomsg~0); {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {14085#(= (+ (* (- 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; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,188 INFO L290 TraceCheckUtils]: 70: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,188 INFO L290 TraceCheckUtils]: 71: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,188 INFO L290 TraceCheckUtils]: 72: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,189 INFO L290 TraceCheckUtils]: 73: Hoare triple {14085#(= (+ (* (- 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; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,189 INFO L290 TraceCheckUtils]: 74: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,189 INFO L290 TraceCheckUtils]: 75: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,190 INFO L290 TraceCheckUtils]: 76: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~nomsg~0); {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,190 INFO L290 TraceCheckUtils]: 77: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {14085#(= (+ (* (- 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; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,191 INFO L290 TraceCheckUtils]: 80: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,191 INFO L290 TraceCheckUtils]: 81: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,191 INFO L290 TraceCheckUtils]: 82: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,192 INFO L290 TraceCheckUtils]: 83: Hoare triple {14085#(= (+ (* (- 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; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,192 INFO L290 TraceCheckUtils]: 84: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,192 INFO L290 TraceCheckUtils]: 85: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,193 INFO L290 TraceCheckUtils]: 86: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~nomsg~0); {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,193 INFO L290 TraceCheckUtils]: 87: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,193 INFO L290 TraceCheckUtils]: 88: Hoare triple {14085#(= (+ (* (- 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; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,194 INFO L290 TraceCheckUtils]: 89: Hoare triple {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {14085#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:57:00,194 INFO L290 TraceCheckUtils]: 90: Hoare triple {14085#(= (+ (* (- 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; {14084#false} is VALID [2022-02-20 18:57:00,194 INFO L290 TraceCheckUtils]: 91: Hoare triple {14084#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {14084#false} is VALID [2022-02-20 18:57:00,195 INFO L290 TraceCheckUtils]: 92: Hoare triple {14084#false} ~mode6~0 := 0; {14084#false} is VALID [2022-02-20 18:57:00,195 INFO L290 TraceCheckUtils]: 93: Hoare triple {14084#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {14084#false} is VALID [2022-02-20 18:57:00,195 INFO L290 TraceCheckUtils]: 94: Hoare triple {14084#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {14084#false} is VALID [2022-02-20 18:57:00,195 INFO L290 TraceCheckUtils]: 95: Hoare triple {14084#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {14084#false} is VALID [2022-02-20 18:57:00,196 INFO L290 TraceCheckUtils]: 96: Hoare triple {14084#false} ~mode7~0 := 0; {14084#false} is VALID [2022-02-20 18:57:00,196 INFO L290 TraceCheckUtils]: 97: Hoare triple {14084#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {14084#false} is VALID [2022-02-20 18:57:00,196 INFO L290 TraceCheckUtils]: 98: Hoare triple {14084#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {14084#false} is VALID [2022-02-20 18:57:00,196 INFO L290 TraceCheckUtils]: 99: Hoare triple {14084#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {14084#false} is VALID [2022-02-20 18:57:00,196 INFO L290 TraceCheckUtils]: 100: Hoare triple {14084#false} ~mode8~0 := 0; {14084#false} is VALID [2022-02-20 18:57:00,196 INFO L290 TraceCheckUtils]: 101: Hoare triple {14084#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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {14084#false} is VALID [2022-02-20 18:57:00,196 INFO L290 TraceCheckUtils]: 102: Hoare triple {14084#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {14084#false} is VALID [2022-02-20 18:57:00,197 INFO L290 TraceCheckUtils]: 103: Hoare triple {14084#false} ~__return_61007~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61007~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; {14084#false} is VALID [2022-02-20 18:57:00,197 INFO L290 TraceCheckUtils]: 104: Hoare triple {14084#false} assume 0 == main_~assert__arg~0#1 % 256; {14084#false} is VALID [2022-02-20 18:57:00,197 INFO L290 TraceCheckUtils]: 105: Hoare triple {14084#false} assume !false; {14084#false} is VALID [2022-02-20 18:57:00,197 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:57:00,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:00,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120942064] [2022-02-20 18:57:00,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120942064] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:00,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:00,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:00,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492837547] [2022-02-20 18:57:00,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:00,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 18:57:00,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:00,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:00,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:00,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:00,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:00,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:00,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:00,271 INFO L87 Difference]: Start difference. First operand 1250 states and 1937 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:01,072 INFO L93 Difference]: Finished difference Result 3494 states and 5475 transitions. [2022-02-20 18:57:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 18:57:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:57:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:57:01,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:57:01,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:01,556 INFO L225 Difference]: With dead ends: 3494 [2022-02-20 18:57:01,556 INFO L226 Difference]: Without dead ends: 2308 [2022-02-20 18:57:01,558 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:57:01,558 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 111 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 449 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:57:01,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 449 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2022-02-20 18:57:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2306. [2022-02-20 18:57:01,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:01,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2308 states. Second operand has 2306 states, 2305 states have (on average 1.5553145336225596) internal successors, (3585), 2305 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:01,637 INFO L74 IsIncluded]: Start isIncluded. First operand 2308 states. Second operand has 2306 states, 2305 states have (on average 1.5553145336225596) internal successors, (3585), 2305 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:01,641 INFO L87 Difference]: Start difference. First operand 2308 states. Second operand has 2306 states, 2305 states have (on average 1.5553145336225596) internal successors, (3585), 2305 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:01,795 INFO L93 Difference]: Finished difference Result 2308 states and 3586 transitions. [2022-02-20 18:57:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2022-02-20 18:57:01,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:01,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:01,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 2306 states, 2305 states have (on average 1.5553145336225596) internal successors, (3585), 2305 states have internal predecessors, (3585), 0 states have call successors, (0), 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 2308 states. [2022-02-20 18:57:01,807 INFO L87 Difference]: Start difference. First operand has 2306 states, 2305 states have (on average 1.5553145336225596) internal successors, (3585), 2305 states have internal predecessors, (3585), 0 states have call successors, (0), 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 2308 states. [2022-02-20 18:57:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:01,972 INFO L93 Difference]: Finished difference Result 2308 states and 3586 transitions. [2022-02-20 18:57:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2022-02-20 18:57:01,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:01,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:01,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:01,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.5553145336225596) internal successors, (3585), 2305 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3585 transitions. [2022-02-20 18:57:02,210 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3585 transitions. Word has length 106 [2022-02-20 18:57:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:02,210 INFO L470 AbstractCegarLoop]: Abstraction has 2306 states and 3585 transitions. [2022-02-20 18:57:02,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3585 transitions. [2022-02-20 18:57:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-20 18:57:02,211 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:02,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:02,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:57:02,212 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash -67978193, now seen corresponding path program 1 times [2022-02-20 18:57:02,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:02,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336993346] [2022-02-20 18:57:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:02,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {26808#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(50, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~__return_60836~0 := 0;~__return_61007~0 := 0; {26808#true} is VALID [2022-02-20 18:57:02,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {26808#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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~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;~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;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {26808#true} assume 0 == ~r1~0 % 256; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {26808#true} assume ~id1~0 >= 0; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {26808#true} assume 0 == ~st1~0; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {26808#true} assume ~send1~0 == ~id1~0; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {26808#true} assume 0 == ~mode1~0 % 256; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {26808#true} assume ~id2~0 >= 0; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {26808#true} assume 0 == ~st2~0; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {26808#true} assume ~send2~0 == ~id2~0; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {26808#true} assume 0 == ~mode2~0 % 256; {26808#true} is VALID [2022-02-20 18:57:02,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {26808#true} assume ~id3~0 >= 0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {26808#true} assume 0 == ~st3~0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {26808#true} assume ~send3~0 == ~id3~0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {26808#true} assume 0 == ~mode3~0 % 256; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {26808#true} assume ~id4~0 >= 0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {26808#true} assume 0 == ~st4~0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {26808#true} assume ~send4~0 == ~id4~0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {26808#true} assume 0 == ~mode4~0 % 256; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {26808#true} assume ~id5~0 >= 0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {26808#true} assume 0 == ~st5~0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {26808#true} assume ~send5~0 == ~id5~0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {26808#true} assume 0 == ~mode5~0 % 256; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {26808#true} assume ~id6~0 >= 0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {26808#true} assume 0 == ~st6~0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {26808#true} assume ~send6~0 == ~id6~0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {26808#true} assume 0 == ~mode6~0 % 256; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {26808#true} assume ~id7~0 >= 0; {26808#true} is VALID [2022-02-20 18:57:02,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {26808#true} assume 0 == ~st7~0; {26808#true} is VALID [2022-02-20 18:57:02,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {26808#true} assume ~send7~0 == ~id7~0; {26808#true} is VALID [2022-02-20 18:57:02,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {26808#true} assume 0 == ~mode7~0 % 256; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id8~0 >= 0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~st8~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send8~0 == ~id8~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~mode8~0 % 256; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id8~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id8~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,287 INFO L290 TraceCheckUtils]: 51: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,288 INFO L290 TraceCheckUtils]: 52: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id8~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,288 INFO L290 TraceCheckUtils]: 54: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,288 INFO L290 TraceCheckUtils]: 55: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,289 INFO L290 TraceCheckUtils]: 56: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id8~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,289 INFO L290 TraceCheckUtils]: 57: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,289 INFO L290 TraceCheckUtils]: 58: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,290 INFO L290 TraceCheckUtils]: 59: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id8~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,290 INFO L290 TraceCheckUtils]: 61: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id8~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_60836~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_60836~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,291 INFO L290 TraceCheckUtils]: 63: Hoare triple {26810#(= (+ ~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,291 INFO L290 TraceCheckUtils]: 64: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,292 INFO L290 TraceCheckUtils]: 66: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send1~0 != ~nomsg~0); {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,292 INFO L290 TraceCheckUtils]: 67: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,293 INFO L290 TraceCheckUtils]: 68: Hoare triple {26810#(= (+ ~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; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,293 INFO L290 TraceCheckUtils]: 70: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,294 INFO L290 TraceCheckUtils]: 71: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send2~0 != ~nomsg~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,294 INFO L290 TraceCheckUtils]: 72: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,294 INFO L290 TraceCheckUtils]: 73: Hoare triple {26810#(= (+ ~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; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,295 INFO L290 TraceCheckUtils]: 74: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,295 INFO L290 TraceCheckUtils]: 75: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,295 INFO L290 TraceCheckUtils]: 76: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send3~0 != ~nomsg~0); {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,296 INFO L290 TraceCheckUtils]: 77: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {26810#(= (+ ~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; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,296 INFO L290 TraceCheckUtils]: 79: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send4~0 != ~nomsg~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,298 INFO L290 TraceCheckUtils]: 83: Hoare triple {26810#(= (+ ~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; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,298 INFO L290 TraceCheckUtils]: 84: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,298 INFO L290 TraceCheckUtils]: 85: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,299 INFO L290 TraceCheckUtils]: 86: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send5~0 != ~nomsg~0); {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,299 INFO L290 TraceCheckUtils]: 87: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,299 INFO L290 TraceCheckUtils]: 88: Hoare triple {26810#(= (+ ~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; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,300 INFO L290 TraceCheckUtils]: 89: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,300 INFO L290 TraceCheckUtils]: 90: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,300 INFO L290 TraceCheckUtils]: 91: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send6~0 != ~nomsg~0); {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,301 INFO L290 TraceCheckUtils]: 92: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,301 INFO L290 TraceCheckUtils]: 93: Hoare triple {26810#(= (+ ~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; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,301 INFO L290 TraceCheckUtils]: 94: Hoare triple {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {26810#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:02,302 INFO L290 TraceCheckUtils]: 95: Hoare triple {26810#(= (+ ~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; {26809#false} is VALID [2022-02-20 18:57:02,302 INFO L290 TraceCheckUtils]: 96: Hoare triple {26809#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {26809#false} is VALID [2022-02-20 18:57:02,302 INFO L290 TraceCheckUtils]: 97: Hoare triple {26809#false} ~mode7~0 := 0; {26809#false} is VALID [2022-02-20 18:57:02,302 INFO L290 TraceCheckUtils]: 98: Hoare triple {26809#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {26809#false} is VALID [2022-02-20 18:57:02,302 INFO L290 TraceCheckUtils]: 99: Hoare triple {26809#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {26809#false} is VALID [2022-02-20 18:57:02,302 INFO L290 TraceCheckUtils]: 100: Hoare triple {26809#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {26809#false} is VALID [2022-02-20 18:57:02,302 INFO L290 TraceCheckUtils]: 101: Hoare triple {26809#false} ~mode8~0 := 0; {26809#false} is VALID [2022-02-20 18:57:02,302 INFO L290 TraceCheckUtils]: 102: Hoare triple {26809#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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {26809#false} is VALID [2022-02-20 18:57:02,303 INFO L290 TraceCheckUtils]: 103: Hoare triple {26809#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {26809#false} is VALID [2022-02-20 18:57:02,303 INFO L290 TraceCheckUtils]: 104: Hoare triple {26809#false} ~__return_61007~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61007~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; {26809#false} is VALID [2022-02-20 18:57:02,303 INFO L290 TraceCheckUtils]: 105: Hoare triple {26809#false} assume 0 == main_~assert__arg~0#1 % 256; {26809#false} is VALID [2022-02-20 18:57:02,303 INFO L290 TraceCheckUtils]: 106: Hoare triple {26809#false} assume !false; {26809#false} is VALID [2022-02-20 18:57:02,303 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:57:02,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:02,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336993346] [2022-02-20 18:57:02,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336993346] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:02,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:02,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:02,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345242506] [2022-02-20 18:57:02,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:02,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-02-20 18:57:02,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:02,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:02,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:02,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:02,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:02,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:02,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:02,368 INFO L87 Difference]: Start difference. First operand 2306 states and 3585 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:04,467 INFO L93 Difference]: Finished difference Result 6534 states and 10211 transitions. [2022-02-20 18:57:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:04,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-02-20 18:57:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:57:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:57:04,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:57:04,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:05,484 INFO L225 Difference]: With dead ends: 6534 [2022-02-20 18:57:05,484 INFO L226 Difference]: Without dead ends: 4292 [2022-02-20 18:57:05,487 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:57:05,487 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 106 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 445 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:57:05,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 445 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2022-02-20 18:57:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 4290. [2022-02-20 18:57:05,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:05,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4292 states. Second operand has 4290 states, 4289 states have (on average 1.5521100489624622) internal successors, (6657), 4289 states have internal predecessors, (6657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,630 INFO L74 IsIncluded]: Start isIncluded. First operand 4292 states. Second operand has 4290 states, 4289 states have (on average 1.5521100489624622) internal successors, (6657), 4289 states have internal predecessors, (6657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,635 INFO L87 Difference]: Start difference. First operand 4292 states. Second operand has 4290 states, 4289 states have (on average 1.5521100489624622) internal successors, (6657), 4289 states have internal predecessors, (6657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:06,167 INFO L93 Difference]: Finished difference Result 4292 states and 6658 transitions. [2022-02-20 18:57:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6658 transitions. [2022-02-20 18:57:06,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:06,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:06,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 4290 states, 4289 states have (on average 1.5521100489624622) internal successors, (6657), 4289 states have internal predecessors, (6657), 0 states have call successors, (0), 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 4292 states. [2022-02-20 18:57:06,181 INFO L87 Difference]: Start difference. First operand has 4290 states, 4289 states have (on average 1.5521100489624622) internal successors, (6657), 4289 states have internal predecessors, (6657), 0 states have call successors, (0), 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 4292 states. [2022-02-20 18:57:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:06,720 INFO L93 Difference]: Finished difference Result 4292 states and 6658 transitions. [2022-02-20 18:57:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6658 transitions. [2022-02-20 18:57:06,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:06,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:06,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:06,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4290 states, 4289 states have (on average 1.5521100489624622) internal successors, (6657), 4289 states have internal predecessors, (6657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 6657 transitions. [2022-02-20 18:57:07,514 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 6657 transitions. Word has length 107 [2022-02-20 18:57:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:07,515 INFO L470 AbstractCegarLoop]: Abstraction has 4290 states and 6657 transitions. [2022-02-20 18:57:07,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 6657 transitions. [2022-02-20 18:57:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-02-20 18:57:07,516 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:07,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:07,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:57:07,516 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash 827456551, now seen corresponding path program 1 times [2022-02-20 18:57:07,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:07,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674893734] [2022-02-20 18:57:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:07,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {50589#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(50, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~__return_60836~0 := 0;~__return_61007~0 := 0; {50589#true} is VALID [2022-02-20 18:57:07,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {50589#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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~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;~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;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {50589#true} is VALID [2022-02-20 18:57:07,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {50589#true} assume 0 == ~r1~0 % 256; {50589#true} is VALID [2022-02-20 18:57:07,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {50589#true} assume ~id1~0 >= 0; {50589#true} is VALID [2022-02-20 18:57:07,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {50589#true} assume 0 == ~st1~0; {50589#true} is VALID [2022-02-20 18:57:07,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {50589#true} assume ~send1~0 == ~id1~0; {50589#true} is VALID [2022-02-20 18:57:07,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {50589#true} assume 0 == ~mode1~0 % 256; {50589#true} is VALID [2022-02-20 18:57:07,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {50589#true} assume ~id2~0 >= 0; {50589#true} is VALID [2022-02-20 18:57:07,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {50589#true} assume 0 == ~st2~0; {50589#true} is VALID [2022-02-20 18:57:07,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {50589#true} assume ~send2~0 == ~id2~0; {50589#true} is VALID [2022-02-20 18:57:07,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {50589#true} assume 0 == ~mode2~0 % 256; {50589#true} is VALID [2022-02-20 18:57:07,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {50589#true} assume ~id3~0 >= 0; {50589#true} is VALID [2022-02-20 18:57:07,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {50589#true} assume 0 == ~st3~0; {50589#true} is VALID [2022-02-20 18:57:07,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {50589#true} assume ~send3~0 == ~id3~0; {50589#true} is VALID [2022-02-20 18:57:07,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {50589#true} assume 0 == ~mode3~0 % 256; {50589#true} is VALID [2022-02-20 18:57:07,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {50589#true} assume ~id4~0 >= 0; {50589#true} is VALID [2022-02-20 18:57:07,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {50589#true} assume 0 == ~st4~0; {50589#true} is VALID [2022-02-20 18:57:07,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {50589#true} assume ~send4~0 == ~id4~0; {50589#true} is VALID [2022-02-20 18:57:07,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {50589#true} assume 0 == ~mode4~0 % 256; {50589#true} is VALID [2022-02-20 18:57:07,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {50589#true} assume ~id5~0 >= 0; {50589#true} is VALID [2022-02-20 18:57:07,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {50589#true} assume 0 == ~st5~0; {50589#true} is VALID [2022-02-20 18:57:07,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {50589#true} assume ~send5~0 == ~id5~0; {50589#true} is VALID [2022-02-20 18:57:07,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {50589#true} assume 0 == ~mode5~0 % 256; {50589#true} is VALID [2022-02-20 18:57:07,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {50589#true} assume ~id6~0 >= 0; {50589#true} is VALID [2022-02-20 18:57:07,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {50589#true} assume 0 == ~st6~0; {50589#true} is VALID [2022-02-20 18:57:07,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {50589#true} assume ~send6~0 == ~id6~0; {50589#true} is VALID [2022-02-20 18:57:07,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {50589#true} assume 0 == ~mode6~0 % 256; {50589#true} is VALID [2022-02-20 18:57:07,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {50589#true} assume ~id7~0 >= 0; {50589#true} is VALID [2022-02-20 18:57:07,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {50589#true} assume 0 == ~st7~0; {50589#true} is VALID [2022-02-20 18:57:07,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {50589#true} assume ~send7~0 == ~id7~0; {50589#true} is VALID [2022-02-20 18:57:07,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {50589#true} assume 0 == ~mode7~0 % 256; {50589#true} is VALID [2022-02-20 18:57:07,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {50589#true} assume ~id8~0 >= 0; {50589#true} is VALID [2022-02-20 18:57:07,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {50589#true} assume 0 == ~st8~0; {50589#true} is VALID [2022-02-20 18:57:07,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {50589#true} assume ~send8~0 == ~id8~0; {50589#true} is VALID [2022-02-20 18:57:07,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {50589#true} assume 0 == ~mode8~0 % 256; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id2~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id3~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id4~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id5~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id6~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id7~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id8~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id3~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id4~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id5~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id6~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id7~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id8~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id4~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id5~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id6~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id7~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id8~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id5~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id6~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id7~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id8~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id6~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,605 INFO L290 TraceCheckUtils]: 58: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id7~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,605 INFO L290 TraceCheckUtils]: 59: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id8~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,605 INFO L290 TraceCheckUtils]: 60: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id7~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id8~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,606 INFO L290 TraceCheckUtils]: 62: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_60836~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_60836~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,607 INFO L290 TraceCheckUtils]: 63: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,607 INFO L290 TraceCheckUtils]: 64: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,607 INFO L290 TraceCheckUtils]: 65: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,608 INFO L290 TraceCheckUtils]: 66: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send1~0 != ~nomsg~0); {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,608 INFO L290 TraceCheckUtils]: 67: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,608 INFO L290 TraceCheckUtils]: 68: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,609 INFO L290 TraceCheckUtils]: 69: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,609 INFO L290 TraceCheckUtils]: 70: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,609 INFO L290 TraceCheckUtils]: 71: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send2~0 != ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,610 INFO L290 TraceCheckUtils]: 72: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,610 INFO L290 TraceCheckUtils]: 73: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,610 INFO L290 TraceCheckUtils]: 74: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,611 INFO L290 TraceCheckUtils]: 75: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,611 INFO L290 TraceCheckUtils]: 76: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send3~0 != ~nomsg~0); {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,611 INFO L290 TraceCheckUtils]: 77: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,612 INFO L290 TraceCheckUtils]: 79: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,622 INFO L290 TraceCheckUtils]: 80: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,633 INFO L290 TraceCheckUtils]: 81: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send4~0 != ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,633 INFO L290 TraceCheckUtils]: 82: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,633 INFO L290 TraceCheckUtils]: 83: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,634 INFO L290 TraceCheckUtils]: 84: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,634 INFO L290 TraceCheckUtils]: 85: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,634 INFO L290 TraceCheckUtils]: 86: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send5~0 != ~nomsg~0); {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,635 INFO L290 TraceCheckUtils]: 87: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,635 INFO L290 TraceCheckUtils]: 88: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,636 INFO L290 TraceCheckUtils]: 89: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,636 INFO L290 TraceCheckUtils]: 90: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,636 INFO L290 TraceCheckUtils]: 91: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send6~0 != ~nomsg~0); {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,637 INFO L290 TraceCheckUtils]: 92: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,637 INFO L290 TraceCheckUtils]: 93: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,637 INFO L290 TraceCheckUtils]: 94: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,638 INFO L290 TraceCheckUtils]: 95: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode7~0 % 256);havoc main_~node7____CPAchecker_TMP_0~0#1; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,638 INFO L290 TraceCheckUtils]: 96: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send7~0 != ~nomsg~0); {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,639 INFO L290 TraceCheckUtils]: 97: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node7____CPAchecker_TMP_0~0#1 := ~p7_new~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,639 INFO L290 TraceCheckUtils]: 99: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:07,640 INFO L290 TraceCheckUtils]: 100: Hoare triple {50591#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {50590#false} is VALID [2022-02-20 18:57:07,640 INFO L290 TraceCheckUtils]: 101: Hoare triple {50590#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {50590#false} is VALID [2022-02-20 18:57:07,640 INFO L290 TraceCheckUtils]: 102: Hoare triple {50590#false} ~mode8~0 := 0; {50590#false} is VALID [2022-02-20 18:57:07,640 INFO L290 TraceCheckUtils]: 103: Hoare triple {50590#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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {50590#false} is VALID [2022-02-20 18:57:07,640 INFO L290 TraceCheckUtils]: 104: Hoare triple {50590#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {50590#false} is VALID [2022-02-20 18:57:07,640 INFO L290 TraceCheckUtils]: 105: Hoare triple {50590#false} ~__return_61007~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61007~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; {50590#false} is VALID [2022-02-20 18:57:07,641 INFO L290 TraceCheckUtils]: 106: Hoare triple {50590#false} assume 0 == main_~assert__arg~0#1 % 256; {50590#false} is VALID [2022-02-20 18:57:07,641 INFO L290 TraceCheckUtils]: 107: Hoare triple {50590#false} assume !false; {50590#false} is VALID [2022-02-20 18:57:07,641 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:57:07,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:07,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674893734] [2022-02-20 18:57:07,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674893734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:07,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:07,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:07,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820817761] [2022-02-20 18:57:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-02-20 18:57:07,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:07,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:07,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:07,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:07,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:07,712 INFO L87 Difference]: Start difference. First operand 4290 states and 6657 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:14,398 INFO L93 Difference]: Finished difference Result 12230 states and 19011 transitions. [2022-02-20 18:57:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-02-20 18:57:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:57:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2022-02-20 18:57:14,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 489 transitions. [2022-02-20 18:57:14,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:16,977 INFO L225 Difference]: With dead ends: 12230 [2022-02-20 18:57:16,977 INFO L226 Difference]: Without dead ends: 8004 [2022-02-20 18:57:16,981 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:57:16,982 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 101 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 441 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:57:16,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 441 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8004 states. [2022-02-20 18:57:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8004 to 8002. [2022-02-20 18:57:17,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:17,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8004 states. Second operand has 8002 states, 8001 states have (on average 1.5439320084989376) internal successors, (12353), 8001 states have internal predecessors, (12353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:17,269 INFO L74 IsIncluded]: Start isIncluded. First operand 8004 states. Second operand has 8002 states, 8001 states have (on average 1.5439320084989376) internal successors, (12353), 8001 states have internal predecessors, (12353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:17,279 INFO L87 Difference]: Start difference. First operand 8004 states. Second operand has 8002 states, 8001 states have (on average 1.5439320084989376) internal successors, (12353), 8001 states have internal predecessors, (12353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:19,236 INFO L93 Difference]: Finished difference Result 8004 states and 12354 transitions. [2022-02-20 18:57:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8004 states and 12354 transitions. [2022-02-20 18:57:19,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:19,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:19,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 8002 states, 8001 states have (on average 1.5439320084989376) internal successors, (12353), 8001 states have internal predecessors, (12353), 0 states have call successors, (0), 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 8004 states. [2022-02-20 18:57:19,262 INFO L87 Difference]: Start difference. First operand has 8002 states, 8001 states have (on average 1.5439320084989376) internal successors, (12353), 8001 states have internal predecessors, (12353), 0 states have call successors, (0), 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 8004 states. [2022-02-20 18:57:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:21,240 INFO L93 Difference]: Finished difference Result 8004 states and 12354 transitions. [2022-02-20 18:57:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 8004 states and 12354 transitions. [2022-02-20 18:57:21,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:21,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:21,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:21,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8002 states, 8001 states have (on average 1.5439320084989376) internal successors, (12353), 8001 states have internal predecessors, (12353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8002 states to 8002 states and 12353 transitions. [2022-02-20 18:57:24,001 INFO L78 Accepts]: Start accepts. Automaton has 8002 states and 12353 transitions. Word has length 108 [2022-02-20 18:57:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:24,002 INFO L470 AbstractCegarLoop]: Abstraction has 8002 states and 12353 transitions. [2022-02-20 18:57:24,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 8002 states and 12353 transitions. [2022-02-20 18:57:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-20 18:57:24,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:24,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:24,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:57:24,003 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1506711706, now seen corresponding path program 1 times [2022-02-20 18:57:24,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:24,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145333513] [2022-02-20 18:57:24,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:24,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {95090#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(50, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~__return_60836~0 := 0;~__return_61007~0 := 0; {95090#true} is VALID [2022-02-20 18:57:24,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {95090#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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~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;~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;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {95090#true} is VALID [2022-02-20 18:57:24,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {95090#true} assume 0 == ~r1~0 % 256; {95090#true} is VALID [2022-02-20 18:57:24,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {95090#true} assume ~id1~0 >= 0; {95090#true} is VALID [2022-02-20 18:57:24,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {95090#true} assume 0 == ~st1~0; {95092#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:24,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {95092#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {95092#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:24,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {95092#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {95092#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:24,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {95092#(<= ~st1~0 0)} assume ~id2~0 >= 0; {95092#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:24,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {95092#(<= ~st1~0 0)} assume 0 == ~st2~0; {95093#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {95093#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {95093#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {95093#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {95093#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {95093#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {95093#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {95093#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {95094#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {95094#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {95094#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {95094#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {95094#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {95094#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {95094#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {95094#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {95095#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {95095#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {95095#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {95095#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {95095#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {95095#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {95095#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {95095#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {95096#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {95096#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {95096#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {95096#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {95096#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {95096#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {95096#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:24,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {95096#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {95097#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {95097#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {95097#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {95097#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {95097#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {95097#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {95097#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {95097#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {95098#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {95098#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {95098#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {95098#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {95098#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {95098#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id8~0 >= 0; {95098#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {95098#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~st8~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send8~0 == ~id8~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode8~0 % 256; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id8~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,142 INFO L290 TraceCheckUtils]: 45: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id8~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,144 INFO L290 TraceCheckUtils]: 51: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id8~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id8~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id8~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id8~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_60836~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_60836~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,148 INFO L290 TraceCheckUtils]: 63: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~send1~0 != ~nomsg~0); {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,150 INFO L290 TraceCheckUtils]: 67: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~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; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,151 INFO L290 TraceCheckUtils]: 69: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,151 INFO L290 TraceCheckUtils]: 70: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,151 INFO L290 TraceCheckUtils]: 71: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~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; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,153 INFO L290 TraceCheckUtils]: 74: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,153 INFO L290 TraceCheckUtils]: 75: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~send3~0 != ~nomsg~0); {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,155 INFO L290 TraceCheckUtils]: 78: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~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; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,155 INFO L290 TraceCheckUtils]: 79: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,156 INFO L290 TraceCheckUtils]: 80: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,156 INFO L290 TraceCheckUtils]: 81: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,156 INFO L290 TraceCheckUtils]: 82: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,158 INFO L290 TraceCheckUtils]: 83: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~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; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,158 INFO L290 TraceCheckUtils]: 84: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,159 INFO L290 TraceCheckUtils]: 85: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,159 INFO L290 TraceCheckUtils]: 86: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~send5~0 != ~nomsg~0); {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,165 INFO L290 TraceCheckUtils]: 87: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,165 INFO L290 TraceCheckUtils]: 88: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~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; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,166 INFO L290 TraceCheckUtils]: 90: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,166 INFO L290 TraceCheckUtils]: 91: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~send6~0 != ~nomsg~0); {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~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; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,168 INFO L290 TraceCheckUtils]: 95: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode7~0 % 256);havoc main_~node7____CPAchecker_TMP_0~0#1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~send7~0 != ~nomsg~0); {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,168 INFO L290 TraceCheckUtils]: 97: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} main_~node7____CPAchecker_TMP_0~0#1 := ~p7_new~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,169 INFO L290 TraceCheckUtils]: 98: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~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; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,169 INFO L290 TraceCheckUtils]: 99: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode8~0 % 256);havoc main_~node8____CPAchecker_TMP_0~0#1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~send8~0 != ~nomsg~0); {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,170 INFO L290 TraceCheckUtils]: 102: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} main_~node8____CPAchecker_TMP_0~0#1 := ~p8_new~0; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,174 INFO L290 TraceCheckUtils]: 103: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p8_new~0 := (if main_~node8____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node8____CPAchecker_TMP_0~0#1 % 256 else main_~node8____CPAchecker_TMP_0~0#1 % 256 - 256);~mode8~0 := 1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,175 INFO L290 TraceCheckUtils]: 104: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:57:24,175 INFO L290 TraceCheckUtils]: 105: Hoare triple {95099#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {95091#false} is VALID [2022-02-20 18:57:24,175 INFO L290 TraceCheckUtils]: 106: Hoare triple {95091#false} ~__return_61007~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61007~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; {95091#false} is VALID [2022-02-20 18:57:24,175 INFO L290 TraceCheckUtils]: 107: Hoare triple {95091#false} assume 0 == main_~assert__arg~0#1 % 256; {95091#false} is VALID [2022-02-20 18:57:24,176 INFO L290 TraceCheckUtils]: 108: Hoare triple {95091#false} assume !false; {95091#false} is VALID [2022-02-20 18:57:24,176 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:57:24,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:24,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145333513] [2022-02-20 18:57:24,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145333513] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:24,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:24,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:57:24,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943149454] [2022-02-20 18:57:24,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:24,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-02-20 18:57:24,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:24,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:24,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:24,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:57:24,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:24,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:57:24,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:57:24,251 INFO L87 Difference]: Start difference. First operand 8002 states and 12353 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)